Q.

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
2k
0
Do you find this helpful?
6

View all MCQs in

Data Structures (DS)

Discussion

No comments yet