/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
public:
int maxDepth(TreeNode *root) {
int result = 0;
int ltree=0;
int rtree=0;
if(root==NULL)return 0;
ltree=1+maxDepth(root->left);
rtree=1+maxDepth(root->right);
return ltree > rtree?ltree:rtree;
}
};
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
//与same tree类似,遍历这两棵tree,记录最深
class Solution {public:
int maxDepth(TreeNode *root) {
int result = 0;
int ltree=0;
int rtree=0;
if(root==NULL)return 0;
ltree=1+maxDepth(root->left);
rtree=1+maxDepth(root->right);
return ltree > rtree?ltree:rtree;
}
};