当前位置：网站首页>leetcode 110. Balanced Binary Trees

leetcode 110. Balanced Binary Trees

2022-08-07 06:32:00 【henujolly】

class Solution {
    
    public boolean isBalanced(TreeNode root) {
    
      if(root==null) return true;
      return Math.abs(depth(root.left)-depth(root.right))<=1&&isBalanced(root.left)&&isBalanced(root.right);
    }
    public int depth(TreeNode root){
    
        if(root==null) return 0;
        int left=depth(root.left);
        int right=depth(root.right);
        return Math.max(left,right)+1;
    }
}