[Leetcode]Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

解：

考虑深度优先访问方式求深度.

/**
* Definition for a binary tree node.
* struct TreeNode {
*     int val;
*     struct TreeNode *left;
*     struct TreeNode *right;
* };
*/
int maxDepth(struct TreeNode* root) {
int u = 0, v = 0;

if (root == NULL){
return 0;
}

u = maxDepth(root->left);
v = maxDepth(root->right);

return (u > v ? (u+1) : (v+1));
}