标签：des style blog color io art
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.
1 class Solution{ 2 public: 3 int maxDepth(TreeNode *root){ 4 if(root==NULL) 5 { 6 return 0; 7 } 8 int a=maxDepth(root->left); 9 int b=maxDepth(root->right); 10 return (a>b?a:b)+1; 11 } 12 };
LeetCode:Maximum Depth of Binary Tree,布布扣,bubuko.com
LeetCode:Maximum Depth of Binary Tree
标签：des style blog color io art
原文地址：http://www.cnblogs.com/levicode/p/3856326.html
