判断一棵二叉树是否是平衡二叉树?
1.一棵树任何一个节点的左子树高度和右子树高度的差值不能大于1.
2.求树的高度是关键的一步。
3.可以有两种方式:从上到下递归和从下到上递归
从上到下:
**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
private int height(TreeNode root)
{
if (root==null)
{
return 0;
}
return Math.max(height(root.left),height(root.right))+1;
}
public boolean isBalanced(TreeNode root) {
if (root==null)
{return true;}
return Math.abs(height(root.left)-height(root.right))<2
&& isBalanced(root.left)&&isBalanced(root.right);
}
}
结果:
很明显这种方式很慢,因为要重复多次计算下面节点的高度。
从下到上:
先判断左子树是否平衡,再判断右子树是否平衡,最后判断根节点是否平衡。
class Solution {
// Return whether or not the tree at root is balanced while also storing
// the tree's height in a reference variable.
private TreeInfo isBalancedTreeHelper(TreeNode root) {
// An empty tree is balanced and has height = -1
if (root == null) {
return new TreeInfo(-1, true);
}
// Check subtrees to see if they are balanced.
TreeInfo left = isBalancedTreeHelper(root.left);
if (!left.balanced) {
return new TreeInfo(-1, false);
}
TreeInfo right = isBalancedTreeHelper(root.right);
if (!right.balanced) {
return new TreeInfo(-1, false);
}
// Use the height obtained from the recursive calls to
// determine if the current node is also balanced.
if (Math.abs(left.height - right.height) < 2) {
return new TreeInfo(Math.max(left.height, right.height) + 1, true);
}
return new TreeInfo(-1, false);
}
public boolean isBalanced(TreeNode root) {
return isBalancedTreeHelper(root).balanced;
}
};