Q. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called …… (Solved)
1. avl tree
2. red-black tree
3. lemma tree
4. none of the above
- a. avl tree
1. avl tree
2. red-black tree
3. lemma tree
4. none of the above