Consider a binary search tree consisting of 127 nodes. The height of the binary search tree with one node is 0. If maximum and minimum possible heights of the binary search tree is H and h then what is the value H2 + 2Hh + h2​?

Enter numerical value using the virtual keypad. Round off where necessary.

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation