lambda1@tg says to YSITD Clearly, such a binary decision tree can at most have 2^h leaves given height h. But then, the tree needs to have n! such leaves to sort a n-item array