Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
int dfs(TreeNode *root){
if(root){
if(root->left==NULL && root->right==NULL)
return 1;
else{
return 1+max(dfs(root->left),dfs(root->right));
}
}
else
return 0;
}
class Solution {
public:
int maxDepth(TreeNode *root) {
return dfs(root);
}
};