Thirty Two Bad Orders
You insert the keys through into an empty binary search tree, one at a time, with no rebalancing. There are possible insertion orders. Some of them produce a tree of height 5, that is, a single path with no node having two children.
How many of the 720 orders produce such a path?
Sign in to answer questions and track your progress
Sign In