二叉树准备:
package com.stuk;
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
二叉树深度题目:输入一棵二叉树,求该树的深度。从根结点到叶结点依次经过的结点(含根、叶结点)形成树的一条路径,最长路径的长度为树的深度。
逻辑分析:找到该结点的左子树的最大深度和右子树的最大深度(该结点左右为null + 1),取两者最大值并+1。
代码实现:
package com.stuk;
public class Main1 {
public static void main(String[] args) {
TreeNode tree = new TreeNode(10);
tree.left = new TreeNode(5);
tree.right = new TreeNode(12);
tree.left.left = new TreeNode(4);
tree.left.right = new TreeNode(7);
System.out.println(IsBalanced_Solution(tree));
}
public static int IsBalanced_Solution(TreeNode root) {
return height(root);
}
private static int height(TreeNode root) {
if (root == null) {
return 0;
}
int left = height(root.left);
int right = height(root.right);
return 1 + Math.max(right, left);
}
}
平衡二叉树题目:输入一棵二叉树,判断该二叉树是否是平衡二叉树。(空树或者左右子树深度之差不超过1)
逻辑分析:
我们只需要去判断每个结点是否平衡,递归判断即可。
(1) 1,2,3,4压栈,下一次为4的左孩子为null,走到4的右孩子为null,得到left、right都为0,差值不大于1,4结点为平衡结点,接下来将解压栈4到3,说明3结点有一个深度为1的左孩子,我们将取4结点的最大深度加1,走到3的右孩子为null…每一步都的结果值标在上面1代表3的当前深度
代码实现:
package com.stuk;
public class Main1 {
private static boolean isOverHeightOne = true;
public static void main(String[] args) {
TreeNode tree = new TreeNode(10);
tree.left = new TreeNode(5);
tree.right = new TreeNode(12);
tree.left.left = new TreeNode(4);
tree.left.right = new TreeNode(7);
System.out.println(IsBalanced_Solution(tree));
}
public static boolean IsBalanced_Solution(TreeNode root) {
height(root);
return isOverHeightOne;
}
private static int height(TreeNode root) {
if (root == null || !isOverHeightOne) {
return 0;
}
int left = height(root.left);
int right = height(root.right);
if (Math.abs(left - right) > 1) {
isOverHeightOne = false;
}
return 1 + Math.max(right, left);
}
}