Advantage of avl tree over binary search tree.

What is advantage using avl tree instead of using binary search tree ?

Questions by nipa123456

Showing Answers 1 - 2 of 2 Answers

fkhalikov

  • Feb 5th, 2011
 

AVL tree is a self-balancing binary tree. For the tree to be considered balanced balance factor must be -1,0 or 1. Balance factor is height of the left subtree minus height of the right subtree of the specific node. To balance tree tree rotation are used. 


kirubasri

  • Sep 8th, 2015
 

Better search times for keys

  Was this answer useful?  Yes

simran

  • Nov 23rd, 2016
 

In BST, the time complexity of search operation (average case) is taken to be O(log n). But in the worst case, i.e the degenerate trees/skewed trees time complexity of search operation is O(n) which can also be attained using array or linked list. So, in order to remove this problem, balanced binary search tree (AVL tree) was introduced in which the time complexity of search operation remains O(log n).

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions