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.
The answer is 1.
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!