public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(){ } TreeNode(int value){ this.val=value; } TreeNode(int value,TreeNode left,TreeNode right){ this.val=value; this.left=left; this.right=right; } }
//判断是否是平衡二叉树: public boolean isBalanced(TreeNode root) { if (root==null){ return true; }else{ return Math.abs(height(root.left)-height(root.right)) <=1 && isBalanced(root.left) && isBalanced(root.right);//要判断左右子树是否都是平衡二叉树;而且左右子树的高度只差nui } } //返回树的高度 public int height(TreeNode root){ if(root==null){ return 0; }else{ return Math.max(height(root.left),height(root.right))+1;//返回树的高度; } }