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) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode *root) {
if(root==NULL)return 0;
int MaxLeft=maxDepth(root->left);
int MaxRight=maxDepth(root->right);
if (MaxLeft>MaxRight)return MaxLeft+1;
else return MaxRight+1;
//递归减少代码,也是DFS的递归实现
}