Question: why we use avl tree?
Answer: A series of rotational steps is carried out along the path through which the insertion or deletion was effected and the tree is re-balanced. AVL trees are best applied in situations of frequent data lookup rather than frequent insertion and deletion operations.