搜索资源列表
datastr
- 数据结构 array.h： 安全数组，可自动增长大小（随机访问，但扩充时效率低） linkedlist.h： 普通链表（可随机访问，但访问效率低） dclinkedlist： 双向循环链表（不可随机访问，但插入、遍历的效率都比普通链表高） hashtable.h： 哈希表（使用键值标识元素，键值一样的元素即认为相等，需重载 == 运算符并由用户定义哈希函数） binstree.h： 二叉搜索树（需重载 == 和 < 运算符） avltree.h： AVL 树（
splayTree
- 主要是avl,splay和binary树的insert,delete程序,主要是avl,splay.binary树的-mainly AVL, SED and the binary tree insert, delete procedures, mainly AVL, splay.binary tree
AVL_Lib
- 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
AVDOS
- 演示了AVL的删除与插入算法，通过模拟dos命令行实现。-demonstration of the AVL delete and insert algorithm simulation dos command line to achieve.
avl_bplus
- 实现avl树和b+树以及用他们管理的数据库demo-achieve AVL tree and b tree and use their database management demo
ImpleOfDataStruct
- 数据结构的实现，包括可自动增长的数组，链表，堆栈，集合，二叉搜索树（元素不会重复），AVL 平衡树等，很好的数据结构源码。所有类均使用模板编写，并不特定于 Windows 平台，所有只要有 C++ 编译程序的操作平台都可使用。-achieve the data structure, including the automatic growth of arrays, linked lists, stacks, collection, Binary Tree Search (elements wil
AVLTreeImpl
- 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!-AVL Tree implementation : I also included a test to compare the fu
AVL_LIB
- 独立于AVL库的存储媒体 虽现在有不少可用的AVL树库，但几乎都是工作在RAM中，当数据量小的时候，这种方式可行，但当树结构变大时时，读取和存储的时间就会大大变长，任务效率大大降低。能不能直接用磁盘进行树的操作呢？若可以，就不必进行频繁的磁盘内存交换了，本程序就实现了这个功能。实际上，这个程序无论是磁盘还是内存，都很好用。-independent of the AVL storage media is now available in a number of the AVL tree, Bu
threetrees
- 对三种数据结构的分析.avl tree,splaytree和binary search tree的插入和删除的算法复杂度分析.-of three data structure analysis. Avl tree, splaytree and binary search tree insertion and deletion algorithm complexity analysis .
shujujiegou__c++
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Binary_Search_Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
tudelinjiebiaobiaoshi
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Kruskal_suanfa
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
Binary__Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
AVL___Tree
- c++编的几个数据结构代码。包括AVL树、二叉搜索树、二叉树、Kruskal算法和图的邻接表表示-c addendum to the few data structure code. Including AVL tree, binary search tree, binary tree, Kruskal map algorithm and the adjoining table
AVLTrees
- It s a note on data structure---AVL tree, very clear and useful!-It's a note on data structure -- AVL tree, very clear and useful!
pinghen
- 平衡二叉树，又称为AVL树，是1962年由Adelsonr Velskii 和Landis 提出并以他们的名字命名的，它是具有如下性质的二叉树：-balanced binary tree, also known as AVL tree, yes in 1962 by Adelsonr Velskii and Landis made and named after them , it is the nature of the binary tree is as follows :
AVLtreeopertion
- 数据结构中对AVL树的一些操作,运行效率较高可以借鉴-data structure of the AVL tree operation, the higher operating efficiency can draw on
libshd
- SH_Object libSH的基类 SH_String String类 SH_Array 数据结构Array类 SH_Stack 数据结构Stack类 SH_Queue 数据结构Queue类 SH_List 数据结构List类 SH_Hash 数据结构Hash类 SH_Tree 数据结构Tree(AVL)类 SH_Lock 互斥Lock类 SH_Serial 串口类 SH_Socket 套接字类 SH_Tcp TCP类
SegmentTree
- 线段树的样例程序，线段树大家都知道吧？类似于算法导论上的区间树，比AVL好实现多了-segment of the sample program for the tree, the tree line you know? Introduction to the algorithm similar to the interval on the tree, to achieve better than AVL more