Question

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 1

a) avl tree