资源列表
quicksorting
- 算法之快速排序,用于说明快速排序的程序.-The quick sort algorithm, used to describe the quick sort procedure.
quickQueue
- 快速排序,对于给定的一组数据，采用快速排序的方法将其排 序-quick Queue for a given group of data
deepLook
- 深度遍历一个二叉树，以读取结点的有关信息-read the data the connection of the two tree in a deep looking way
wideLook
- 为了读取二叉树的结点数据，广度遍历二叉树-Read the information of the connection of the two tree in a wide Looking way
tree-structure
- 该软件构建了一个二叉树，可以达到在存储数据的时候使用二叉树的规则进行存储，以便在查找的时候比较方便-The software to build a binary tree can be achieved when the stored data in the use of binary tree to store the rules in order to search more convenient time
DoubleChainTable
- 该软件实现了一个双向链表类，该类具有查找，增加结点等功能-The software realization of a two-way linked list class, such has search, increase the functions of node
ChainTable
- 该软件实现了一个单向链表的类，具有查找、增加和删除一个结点等功能-The software implements a one-way linked list of categories, with search, increase and delete a node and other functions
bstree
- 这是数据结构中如何查找二叉树的c语言源码，可帮助初学者掌握相关方法-binary tree search
RadixSort
- 用两个数组实现的基数排序方法，时间为（array.length）的平方-RadixSort
MyBuffer
- 内存缓冲区类，按字节宽度存取对象。可以自动管理内存，也可以使用外部申请的内存-Buffer class, by object s width read, deposited. the buffer can automatically allocate and release memory, can also use external allocated
pinghengerchashu
- 平衡二叉树是数据结构中一个非常重要的概念。它对二叉树的优化和提高查询效率有重要的作用，它是动态查找的一个非常重要方法，它在实际生产中有着广泛的应用。 - Balanced binary tree data structure is a very important concept. Its binary tree query optimization and improve efficiency has an important role, it is a dynamic search
adfwfer
- 数据结构的二叉树的叶子结点的求法 范围较好 功能良好 采用链试结构得以实现-Binary tree data structure of the leaf nodes for better well-functioning law-chain test structure used to realize