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

Maximum Depth of Binary Tree

时间:2015-06-25 00:00:30      阅读:281      评论:0      收藏:0      [点我收藏+]

标签:

1. Question

求二叉树的最大深度。

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.

2. Solution

考虑特殊情况:

  • 树为空

采用分治法:

  • 左子树的最大深度lh
  • 右子树的最大深度rh
  • res = 1 + max( lh, rh )
技术分享
/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int maxDepth(TreeNode root) {
        int maxDepth = 0;
        if( root != null ){
            int leftDepth = maxDepth(root.left);
            int rightDepth = maxDepth(root.right);
            maxDepth = (leftDepth>rightDepth ? leftDepth : rightDepth) + 1;
        }
        return maxDepth;
    }
}
View Code

 

Maximum Depth of Binary Tree

标签:

原文地址:http://www.cnblogs.com/hf-cherish/p/4598775.html

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