[Leetcode]Maximum Depth of Binary Tree

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.

解决树的问题很大一部分都是可以用递归来做的。

 

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