Learn about new technologies! 
A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……
AVL tree
Red-black tree
Lemma tree
None of the above
AVL tree
Red-black tree
Lemma tree
None of the above