思路:
这道题很简单,dfs即可。
代码:
在这里插入代码片/**
* 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==NULL) return 0;
int left = maxDepth(root->left) ;
int right = maxDepth(root->right) ;
return max(left,right)+1;
}
};