LeetCode刷题记66
110. 平衡二叉树
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int deep(TreeNode root) {
if (root == null) return 0;
return Math.max(deep(root.left), deep(root.right)) + 1;
}
public boolean isBalanced(TreeNode root) {
if (root == null) return true;
if(root.left == null && root.right == null) {
return true;
}
int d1 = deep(root.left);
int d2 = deep(root.right);
if(Math.abs(d1 - d2) > 1) return false;
return isBalanced(root.left) && isBalanced(root.right);
}
}
4/5
67/150