0 votes
by (1.1k points)

1 Answer

0 votes
by (1.6k points)
selected by
Best answer

it a balanced binary search tree that checks the height of the left and the right sub-tree and assures that the difference is not more than 1.

Welcome to CodersEditor Q&A, where you can ask questions and receive answers from other members of the community.