Question

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

A Lemma tree
B Redblack tree
C AVL tree
D None of the above
Answer & Explanation
Option: [C]

Your Valuable Comments Please...