剑指 Offer 55 - I. 二叉树的深度

思路：利用递归

class Solution {
public:
    int maxDepth(TreeNode* root) {
        if(!root) return 0;
        int left = maxDepth(root->left);
        int right = maxDepth(root->right);
        return  max(left,right)+1; // +1是因为root 
    }
};