110. Balanced Binary Tree

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.

可以先求出每个subtree的深度，然后比较。但不高效，时间复杂度为O(nlgn).因为每一次计算左右subtree深度为2*O(lgn), 然后递归n次。

public bool IsBalanced(TreeNode root) {if(root == null) return true;int left =  TreeHeight(root.left);int right = TreeHeight(root.right);if ((left>=right+2)||(left+2<=right)) return false;return IsBalanced(root.left)&& IsBalanced(root.right);}public int TreeHeight(TreeNode root){if(root == null) return 0;if(root.left == null && root.right == null) return 1;return Math.Max(TreeHeight(root.left), TreeHeight(root.right))+1;}

优化的方法为DFS，先check更小的subtree是否为Balanced Tree, 如果不是则直接返回false。参考http://www.cnblogs.com/grandyang/p/4045660.html

 public bool IsBalanced(TreeNode root) {return !(TreeHeight(root)==-1);}public int TreeHeight(TreeNode root){if(root == null) return 0;int left = TreeHeight(root.left);if(left == -1) return -1;int right = TreeHeight(root.right);if(right == -1) return -1;if ((left>=right+2)||(left+2<=right)) return -1;return Math.Max(left, right)+1;}

转载于:https://www.cnblogs.com/renyualbert/p/5863170.html

110. Balanced Binary Tree相关推荐

LeetCode 110 Balanced Binary Tree 平衡二叉树
LeetCode 110 Balanced Binary Tree Given a binary tree, determine if it is height-balanced. For this ...
leetCode 110. Balanced Binary Tree 平衡二叉树
110. Balanced Binary Tree Given a binary tree, determine if it is height-balanced. For this problem, ...
LeetCode 110. Balanced Binary Tree
LeetCode 110. Balanced Binary Tree 本博客参考自:http://www.cnblogs.com/grandyang/p/4045660.html Solution1: ...
LeetCode 110 Balanced Binary Tree
LeetCode 110 Balanced Binary Tree Problem Description: 判断二叉树是不是平衡二叉树.所谓平衡二叉树,即每个节点的两个子树深度差的绝对值不超过1. ...
Leet Code OJ 110. Balanced Binary Tree [Difficulty: Easy]
题目: Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced bin ...
LeetCode 110 Balanced Binary Tree（平衡二叉树）（*）
版权声明:转载请联系本人,感谢配合!本站地址:http://blog.csdn.net/nomasp https://blog.csdn.net/NoMasp/article/details/5055 ...
leetcode python3 简单题110. Balanced Binary Tree
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第一百一十题 (1)题目英文: Given a binary tree, dete ...
110. Balanced Binary Tree 平衡二叉树
给定一个二叉树,判断它是否是高度平衡的二叉树. 本题中,一棵高度平衡二叉树定义为: 一个二叉树每个节点的左右两个子树的高度差的绝对值不超过1. 示例 1: 给定二叉树 [3,9,20,null,nu ...
110.Balanced Binary Tree
题目描述(简单难度) 判断一棵树是否是平衡二叉树,平衡二叉树定义如下: 它是一棵空树或它的左右两个子树的高度差的绝对值不超过 1,并且左右两个子树都是一棵平衡二叉树. 解法一直接按照定义来吧,并且多 ...

110. Balanced Binary Tree

110. Balanced Binary Tree相关推荐

最新文章

热门文章