Lecture Algorithms and data structures: Chapter 24 - Queue
Lecture Algorithms and data structures: Chapter 24 - Queue
In computer science, an AVL tree (Georgy Adelson-Velsky and Evgenii Landis' tree, named after the inventors) is a self-balancing binary search tree. This chapter includes contents: Background, define height balancing, maintaining balance within a tree.