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.

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

LeetCode之Maximum Depth of Binary Tree,布布扣,bubuko.com

LeetCode之Maximum Depth of Binary Tree

原文：http://blog.csdn.net/smileteo/article/details/21993169