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

原题链接：剑指 Offer 55 - I. 二叉树的深度

 

solution:

        dfs

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