AVL Trees - Data Structures

preview_player
Показать описание
In this video I present Adison-Velskii-Landis self-balancing binary search trees and the rotation operations used to maintain balance. I also provide an analysis that shows the maximum depth of an AVL tree with n nodes is logarithmic in n.
Рекомендации по теме