AVL Tree implementation: I also included a test function to compare the AVL Tree performance with STL Set and Map. Compile the source mavltree.cpp and run it to see the result...
using C++ to build AVL tree and functions
Addison-Velski 和 Landis (AVL-Tree s)的二叉树,可以在对数时间内进行标准的操作,如插入、搜索和删除。
It s a note on data structure-AVL tree, very clear and useful!
my AVL tree implementation. Have tested it for 8! deletions sequences with 8! insertion sequences. Fast for order statistics.
Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanis...
对三种数据结构的分析.avl tree,splaytree和binary search tree的插入和删除的算法复杂度分析.