标签：
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.
Subscribe to see which companies asked this question
c++ code:
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
int max(int x,int y)
{
return x>y?x:y;
}
class Solution {
public:
int maxDepth(TreeNode* root) {
if(!root) return 0;
else return max(maxDepth(root->left),maxDepth(root->right)) + 1;
}
};LeetCode:Maximum Depth of Binary Tree
标签：
原文地址：http://blog.csdn.net/itismelzp/article/details/51331462
