平衡树——自平衡二叉树(Balanced Tree - AVL Tree)

平衡树——自平衡二叉树(Balanced Tree - AVL Tree) 定义(Definition) An AVL tree is a self-balancing binary search tree. It was named after its two inventors: Georgy Adelson-Velsky and Evgenii Landis. Recall that we

>>阅读原文<<