Lower Bound For Comparison Sorting
Thm: Any decision tree that sorts n elements has height ?(n lg n)
What’s the minimum # of leaves?
What’s the maximum # of leaves of a binary tree of height h?
Clearly the minimum # of leaves is less than or equal to the maximum # of leaves