题目:
代码:
/**
* 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 {
int ans=1;
void dfs(TreeNode* root,int deep) //deep为当前层数
{
if(root->left==NULL && root->right==NULL) //叶子
{
ans=max(ans,deep);
return;
}
if(root->left) dfs(root->left,deep+1); //左子树
if(root->right) dfs(root->right,deep+1); //右子树
}
public:
int maxDepth(TreeNode* root) {
if(root==NULL) return 0; //空树
dfs(root,1); //根为第 1 层
return ans;
}
};