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 6?

**Details and Assumotions**

- The height of a tree is the number of edges on the longest downward path between the root and a leaf.

×

Problem Loading...

Note Loading...

Set Loading...