Height (or: depth) of tree = max path length from root to leaf

Height-balanced tree:  ∀  nodes: height(left subtree) = height(right subtree) ± 1

Time complexity of tree algorithms is typically O(height)