论文信息 - A brief study of balancing of AVL tree - 字舞流文

A brief study of balancing of AVL tree

In computer science, an AVL tree Georgy Adelson-Velsky and Landis' tree, named after the inventors is a self-balancing binary search tree.

Saurav Sharma | Shivani Chauhan | Sheetal Rana | Shashank Thakur

[1] Robert Sedgewick,et al. Fast algorithms for sorting and searching strings , 1997, SODA '97.

[2] Wlodzimierz Dobosiewicz,et al. Sorting by Distributive Partitioning , 1978, Inf. Process. Lett..

[3] C. A. R. Hoare,et al. Algorithm 64: Quicksort , 1961, Commun. ACM.