LeetCode -- 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.

Chinese: Given a binary tree, check whether the height is balanced or not.

In this case, a highly balanced binary tree is defined as a binary tree with a depth difference not greater than 1 on two Subtrees on each node.

Recursive judgment.

Java:

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