/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDep;
void getMaxDep(int level,TreeNode *cur)
{
if(cur==NULL)
{
maxDep=maxDep>level?maxDep:level;
return;
}
else
{
getMaxDep(level+1,cur->left);
getMaxDep(level+1,cur->right);
}
}
int maxDepth(TreeNode *root) {
// Note: The Solution object is instantiated only once and is reused by each test case.
maxDep=0;
getMaxDep(0,root);
return maxDep;
}
};
【leetcode】Maximum Depth of Binary Tree
最新推荐文章于 2021-12-01 10:33:50 发布