When trees are short!

Suppose you have 7 distinct elements. How many perfectly balanced binary search trees can we construct from these 7 elements?

Details and Assumptions

  • A BST is perfectly balanced if it is height-balanced and each non-leaf node has 2 children.
×

Problem Loading...

Note Loading...

Set Loading...