leetcode[104]:Maximum Depth of Binary Tree

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 i, j;    i=j=1;    if(!root) return 0;    if(root->left) i += maxDepth(root->left);    if(root->right) j += maxDepth(root->right);    if( i > j ) return i;    return j;}

递归找子树即可。