Inspired by Beakal

Computer Science Level pending

The first seven positive integers (1 to 7) are to be inserted into an empty binary search tree. In how many ways can they be inserted into the tree, such that the resulting tree has a height 5?

For example, if they form a line (1-2-3-4-5-6-7), then the height is 6.


Inspiration.

×

Problem Loading...

Note Loading...

Set Loading...