参考自:《剑指Offer——名企面试官精讲典型编程题》
题目:平衡二叉树
输入一棵二叉树的根结点,判断该树是不是平衡二叉树。如果某二叉树中任意结点的左右子树的深度相差不超过1,那么它就是一棵平衡二叉树。
主要思路:使用递归,分别计算当前节点的左右子树的深度,若左右子树内部已平衡,且它们两者的深度之差不大于1,则说明当前节点所代表的子树也是平衡二叉树,同时返回当前节点的深度(左右子树深度最大值加1),否则返回-1,代表不是平衡二叉树。最后根节点的深度不等于-1,说明该树是平衡二叉树。这里使用递归,相当于自底向上计算,避免了从顶向下的重复计算。
关键点:递归
时间复杂度:O(n)
public class BalancedTree
{
public static void main(String[] args)
{
// 10
// / \
// 6 14
// /\ /\
// 4 8 12 16
TreeNode root = TreeNode.generateBinaryTree();
System.out.println(isBalanced(root)); //true
}
private static boolean isBalanced(TreeNode root)
{
int result = getTreeDepth(root);
return result != -1;
}
private static int getTreeDepth(TreeNode root)
{
if (root == null) return 0;
int leftDepth = getTreeDepth(root.left);
int rightDepth = getTreeDepth(root.right);
//左右子树内部已经平衡
if (leftDepth != -1 && rightDepth != -1)
{
int diffDepth = leftDepth - rightDepth;
//左右子树的高度差不大于1
if (diffDepth <= 1 && diffDepth >= -1)
{
return Math.max(leftDepth, rightDepth) + 1;
}
}
return -1;
}
}
class TreeNode
{
public int val;
public TreeNode left;
public TreeNode right;
public TreeNode(int x)
{
val = x;
}
// 10
// / \
// 6 14
// /\ /\
// 4 8 12 16
/**
* 生成二叉搜索树
* @return
*/
public static TreeNode generateBinaryTree()
{
TreeNode root = new TreeNode(10);
TreeNode node6 = new TreeNode(6);
TreeNode node14 = new TreeNode(14);
TreeNode node4 = new TreeNode(4);
TreeNode node8 = new TreeNode(8);
TreeNode node12 = new TreeNode(12);
TreeNode node16 = new TreeNode(16);
connectNode(root, node6, node14);
connectNode(node6, node4, node8);
connectNode(node14, node12, node16);
return root;
}
public static void connectNode(TreeNode root, TreeNode left, TreeNode right)
{
root.left = left;
root.right = right;
}
}