Since a binary tree of height h has no more than 2h leaves, we have: . The latter inequality comes from breaking up the factorial function:
Taking logs and using their monotonicity property, we have .
So, the height of the tree is at least ... with any fewer comparisons, we won't be able to sort.