标签：
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.
[Solution]
1 int maxDepth(TreeNode *root) 2 { 3 if (root == NULL) 4 return 0; 5 6 return max(maxDepth(root->left), maxDepth(root->right)) + 1; 7 }
leetcode 104. Maximum Depth of Binary Tree
标签：
原文地址：http://www.cnblogs.com/ym65536/p/4295408.html
