It’s a self-balanced binary search tree and first data structure to be invented. Here the heights of the two child subtrees of any node only differ by at most one. If the difference stands for more than one, rebalancing is done to restore the property.

Suggest An Answer

No suggestions Available!