Question

Advantages of avl tree in data structure

Answer 1

AVL Trees The AVL Tree, also known as the self balancing tree, is one of the good features in self sorting binary trees. Having a maximum of only two children for each node, the tree balances itself when ever possible making sure that it get's its full potential benefit of being a Binary Tree.

Answer 2

Answer:

Explanation:

AVL trees (Adelson-Velsky and Landis tree) is like binary search tree but with balancing condition. For AVL tree it's mandatory to have the difference in the height of left subtree and right subtree to be less than or equal to 1 (or -1). Also the height of empty AVL tree is -1.

it's best for searching having complexity O(logn).

Unlike BST it's a height balanced tree also called self balancing tree.