retagged by
326 views

1 Answer

1 votes
1 votes
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).

Related questions

0 votes
0 votes
2 answers
1
vijju532 asked Jun 28, 2018
450 views
how does AVL tree requires o(logn) for all the operation i.e search insert and deletewhile other tree (bst,binary) requires o(n) is it due to balancing factor that avl tr...
3 votes
3 votes
1 answer
2