Binary search tree whose left and right subtrees differ in height by at most 1 unit is called
Answers
Answered by
2
Answer:
That are AVL trees.
Answered by
0
Answer:
Binary search tree whose left sub tree and right sub tree differ in height by one unit is called AVL trees.
Explanation:
An AVL tree is the binary search tree in which every sub tree is an AVL tree but is not entirely balanced. It takes less time to calculate the height of sub trees in the AVL tree which is the main advantage of these trees. So it is widely used in computer algorithms in a design method. The various operations on AVL trees such as insertion, deletions, searching, etc.
Similar questions