Question

Explain the advantages of avl tree over binary search tree

Answer 1

Answer:

• AVL tree is an extended version of Binary search tree which maintain its height on all levels. ... So the main advantage of using AVL tree is its time complexity . You can perform any operation in o(log(n)) only so the data retrival rate is also fast as compared to binary search tree. AVL tree is also self balancing tree.