A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

A. avl tree
B. red-black tree
C. lemma tree
D. none of the above
Answer» A. avl tree
View all MCQs in:   Data Structure (DS)


Help us improve!

We want to make our service better for you. Please take a moment to fill out our survey.

Take Survey