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 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;
}
if(!root->left && !root->right){
return 1;
}
int leftDepth = 0;
int rightDepth = 0;
if(root->left){
leftDepth = maxDepth(root->left)+1;
}
if(root->right){
rightDepth = maxDepth(root->right)+1;
}
return leftDepth>rightDepth?leftDepth:rightDepth;
}
};