AVL树的创建与基本操作
上传时间： 2014-01-03
上传用户：缥缈
安全数组 普通链表 哈希表 二叉搜索树 AVL树 集合类 通用自动机 所有类均使用模板编写，并不特定于 Windows 平台，只要有 C++ 编译程序的操作平台都可使用。
上传时间： 2015-02-02
上传用户：sz_hjbf
数据结构中的AVL TREE的实现
上传时间： 2014-11-02
上传用户：3到15
AVL Tree的实现
上传时间： 2014-06-15
上传用户：wsf950131
Addison-Velski 和 Landis (AVL-Tree s)的二叉树，可以在对数时间内进行标准的操作，如插入、搜索和删除。
标签： Addison-Velski AVL-Tree Landis 二叉树
上传时间： 2013-12-25
上传用户：yuzsu
主要是AVL,splay和binary树的insert,delete程序,主要是AVL,splay.binary树的
上传时间： 2015-05-01
上传用户：wang5829
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 mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.
标签： available libraries Although nearly
上传时间： 2014-01-22
上传用户：zhoujunzhen
演示了AVL的删除与插入算法，通过模拟dos命令行实现。
上传时间： 2013-12-28
上传用户：bruce
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!
标签： Tree implementation performance AVL
上传时间： 2013-12-19
上传用户：3到15
独立于AVL库的存储媒体 虽现在有不少可用的AVL树库，但几乎都是工作在RAM中，当数据量小的时候，这种方式可行，但当树结构变大时时，读取和存储的时间就会大大变长，任务效率大大降低。能不能直接用磁盘进行树的操作呢？若可以，就不必进行频繁的磁盘内存交换了，本程序就实现了这个功能。实际上，这个程序无论是磁盘还是内存，都很好用。
上传时间： 2013-12-17
上传用户：lps11188
