leetcode_题解_Maximum Depth of Binary Tree_简单题

递归函数调用DFS（没有用显式栈，居然AC了）

/** * 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)            return 0;        else if(root->left==NULL && root->right==NULL)            return 1;        else        {            int ldeep,rdeep;            ldeep=maxDepth(root->left);            rdeep=maxDepth(root->right);            if(ldeep>rdeep)                return ldeep+1;            else                return rdeep+1;        }    }};