tailieunhanh - Lecture ECE 250 - Algorithms and data structures: AVL trees

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. | ATER LO ENGINEERING I AVL trees 2 Outline Background Define height balancing Maintaining balance within a tree - AVL trees - Difference of heights - Maintaining balance after insertions and erases - Can we store AVL trees as arrays ATER LO ENGINEERING I AVL trees 3 Background From previous lectures - Binary search trees store linearly ordered data - Best case height ln n - Worst case height O n Requirement - Define and maintain a balance to ensure Q ln n .