首页 > 编程语言 > 详细

Java for LeetCode 110 Balanced Binary Tree

时间:2015-05-23 21:16:31      阅读:237      评论:0      收藏:0      [点我收藏+]

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

解题思路:

递归即可,JAVA实现如下:

    public boolean isBalanced(TreeNode root) {
        if(root==null)
        	return true;
        if(Math.abs(maxDepth(root.left)-maxDepth(root.right))>1)
        	return false;
        return isBalanced(root.left)&&isBalanced(root.right);
    }
   static public int maxDepth(TreeNode root) {
        if(root==null)
            return 0;
        return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
    }

 

Java for LeetCode 110 Balanced Binary Tree

原文:http://www.cnblogs.com/tonyluis/p/4524799.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!