When trees are tall!

Given 10 elements, how many ways are there of making a binary search trees such that it has the maximum possible height (nine)?

×

Problem Loading...

Note Loading...

Set Loading...