码迷,mamicode.com
首页 > 其他好文 > 详细

Maximum Depth of Binary Tree

时间:2014-10-12 17:54:08      阅读:177      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   color   ar   strong   sp   div   art   

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.

Answer:

 int maxDepth(TreeNode *root) 
 {
     if(root == NULL)
     {
         return 0;
     }   
 
     int leftDepth = maxDepth(root->left);
 
     int rightDepth = maxDepth(root->right);
 
     if(leftDepth > rightDepth)
     {
         return leftDepth + 1;
     }
     else
     {
         return rightDepth + 1;
     }   
 }

 

Maximum Depth of Binary Tree

标签:des   style   blog   color   ar   strong   sp   div   art   

原文地址:http://www.cnblogs.com/ich1990/p/4020663.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!