leetcode-110 Balanced Binary Tree

Given a binary tree, determine if it is height-balanced.

For this problem, a height-balanced binary tree is defined as:

a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Example 1:

Given the following tree [3,9,20,null,null,15,7]:

    3
   / \
  9  20
    /  \
   15   7

Return true.

Example 2:

Given the following tree [1,2,2,3,3,null,null,4,4]:

       1
      / \
     2   2
    / \
   3   3
  / \
 4   4

Return false.

条件：每个节点的两个子树的深度相差不超过1，计算出每个节点的深度进行一次判断

    public boolean isBalanced(TreeNode root) {
       if(root == null) {
           return true;
       }else {
           int l = getDfs(root.left);
           int r = getDfs(root.right);
           if(Math.abs(l-r) > 1) {
               return false;
           }else {
               return isBalanced(root.left) && isBalanced(root.right);
           }
       }
        
    }
    
    
    public int getDfs(TreeNode root) {
        if(root == null) {
            return 0;
        }else {
            int l = getDfs(root.left)+1;
            int r = getDfs(root.right)+1;
            return Math.max(l, r);
        }
    }