McqMate
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 |
View all MCQs in
Data Structures (DS)No comments yet