Quiz: Logarithms in Algorithms (Knowledge check)

Why do balanced binary trees have $O(\log n)$ height?

1. A.Because each node has at most 2 children
2. B.Because the number of nodes doubles at each level
3. C.Because logarithms are fast
4. D.Because trees are recursive structures