Study about AVL Tree & Operations

Publication Date : 20/12/2015


Author(s) :

Viraj Mehta , Kapil Prajapati.

Volume/Issue :
Volume 1
,
Issue 2
(12 - 2015)

Abstract :

AVL tree is the first dynamic tree in data structure which minimizes its height during insertion and deletion operations. This is because searching time is directly proportional to the height of binary search tree (BST). When insertion operation is performed it may result into increasing the height of the tree and when deletion is performed it may result into decreasing the height. To make the BST a height balance tree (AVL tree) creators of the AVL tree proposed various rotations. This paper shows BST and its operation and AVL.

No. of Downloads :

78