Leetcode solution 110: Balanced Binary Tree

 Problem Statement 

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

    3
   /   9  20
    /     15   7

       1
      /      2   2
    /    3   3
  /  4   4

Problem link

Video Tutorial

You can find the detailed video tutorial here

• Youtube 
• B站

Thought Process

As described in the problem, it is intuitive to solve this problem recursively, especially given this is a tree related problem. What we can do is get the height of the left sub tree, compared with the right sub tree, then do the logics to see if it’s balanced or not. If at certain level either the left or right sub tree is not balanced, then entire Tree is not balanced. Classic usage for post order traversal.

Solutions

 1 public boolean isBalanced(TreeNode root) {
 2         return maxHeight(root) != -1;
 3     }
 4     
 5     // if -1, means it is not a balanced tree, since it will also return the normal height(int), so boolean is not an option. 
 6     // Kinda of a hack for the return type.
 7     // @return -1 means it‘s already not a balanced tree, else t;he tree height
 8     public int maxHeight(TreeNode root) {
 9         if (root == null) {
10             return 0;
11         }
12         
13         int l = maxHeight(root.left);
14         int r = maxHeight(root.right);
15 
16         // a classic usage of post order traversalß
17         if (l == -1 || r == -1 || Math.abs(l - r) > 1) {
18             return -1;
19         }
20         return Math.max(l, r) + 1;
21     }

Post order traversal using recursion

Calculate the height of the left subtree, calculate the height of the right subtree, then compare. If it‘s already not balanced, return -1 and directly return

Time Complexity: O(N), N is the total tree nodes since it is visited once and only once

Space Complexity: O(1), No extra space is needed

References

• Leetcode discussion

Leetcode solution 110: Balanced Binary Tree

原文：https://www.cnblogs.com/baozitraining/p/11308254.html