A brief study of balancing of AVL tree
Abstract
In computer science, an AVL tree Georgy Adelson-Velsky and Landis' tree, named after the inventors is a self-balancing binary search tree.
Keywords
balancing of AVL tree; computer science
Full Text:
PDFCopyright (c) 2014 Shivani Chauhan, Shashank Thakur, Sheetal Rana, Saurav Sharma
![Creative Commons License](http://licensebuttons.net/l/by-nc-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
All published Articles are Open Access at https://journals.pen2print.org/index.php/ijr/
Paper submission: ijr@pen2print.org