/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode* root)
{
if(!root)
return 0;
else
return max(maxDepth(root->left),maxDepth(root->right))+1;
}
};
Maximum Depth of Binary Tree
最新推荐文章于 2021-12-01 10:33:50 发布