leetcode104. Maximum Depth of Binary Tree

递归求树的深度

class Solution {
public:
   
    int maxDepth(TreeNode* root) {
        if(root==0)return 0;
        int l=1,r=1;
        l+=maxDepth(root->left);
        r+=maxDepth(root->right);
        return l>r?l:r;
    }
};