LeetCode--Maximum Depth of Binary Tree

标签：leetcode   递归   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.

/**
 * 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==NULL)
            return 0;
        int left = maxDepth(root->left);
        int right = maxDepth(root->right);
        return left>right? (left+1) : (right+1);
    }
};

LeetCode--Maximum Depth of Binary Tree

标签：leetcode   递归   tree   

原文地址：http://blog.csdn.net/shaya118/article/details/42707201