A: n-1
Q: If a binary tree has n nodes, what is the minimum height it can be?
A: Since n ≤ nodes(h),
n ≤ 2h+1 − 1 n < 2h+1