Inspired by Beakal
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.
The answer is 160.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
0 solutions
No explanations have been posted yet. Check back later!