Home

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

Study and Earn Android App
Share this question with your friends

Correct Answer : A.


Please do not use chat terms. Example: avoid using "grt" instead of "great".

Submit
Load More..

Also checkout

Machine Input Mi-set 2 MCQ Alligation or Mixture MCQ Statutory Deductions MCQ Java Programming MCQ H.C.F and L.C.M MCQ Angiosperms (Morphology) MCQ Property of Material MCQ Nuclear Physics MCQ Phylum - Arthropoda MCQ Rearrangement Set 11 MCQ Payroll MCQ Active and Passive Voice MCQ