previous | index | next

Binary Tree Properties

Q: A balanced tree of n nodes has what height?

A: log2n


previous | index | next