Table of Contents:

The Problem Introduction 0:00 - 0:33

Cases That Are Height Balanced 0:33 - 1:56

Cases That Are NOT Height Balanced 1:56 - 2:58

Approach #1: Get Heights of Subtrees At Each Node 2:58 - 3:46

Approach #2: Recurse To Base Cases 3:46 - 4:23

Walkthrough of The Recursion 4:23 - 12:39

Time Complexity 12:39 - 13:25

Space Complexity 13:25 - 13:39

Wrap Up 13:39 - 13:57

Code: https://github.com/bephrem1/backtobackswe/blob/master/Trees%2C%20Binary%20Trees%2C%20%26%20Binary%20Search%20Trees/HeightBalancedBinaryTree/HeightBalancedBinaryTree.java

Leetcode Link: https://leetcode.com/problems/balanced-binary-tree/

Elements of Programming Interviews: 10.1