搜索资源列表
Splaytree
- 伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree
splayTree
- 主要是avl,splay和binary树的insert,delete程序,主要是avl,splay.binary树的-mainly AVL, SED and the binary tree insert, delete procedures, mainly AVL, splay.binary tree
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 .
splaytreeopertion
- 数据中对splaytree的一些操作,执行效率较高有借鉴意义-splaytree data on the operation more efficient implementation of referential significance
Splay
- 伸展树 都知道如果使用二叉查找树树平衡度不好则会降低查询效率，所以我们要维护二叉树的平衡性，即TreapTree 、SplayTree 、AVL、红黑等，本文介绍伸展树的平衡原理和核心代码
Splaytree
- 伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree
splayTree
- 主要是avl,splay和binary树的insert,delete程序,主要是avl,splay.binary树的-mainly AVL, SED and the binary tree insert, delete procedures, mainly AVL, splay.binary tree
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 .
splaytreeopertion
- 数据中对splaytree的一些操作,执行效率较高有借鉴意义-splaytree data on the operation more efficient implementation of referential significance
Splay
- 伸展树 都知道如果使用二叉查找树树平衡度不好则会降低查询效率，所以我们要维护二叉树的平衡性，即TreapTree 、SplayTree 、AVL、红黑等，本文介绍伸展树的平衡原理和核心代码 -Tree stretching all know if you use binary search tree tree balance will not reduce the query efficiency, and therefore
splay
- Data Structures and Algorithm Analysis 一书中建立splaytree的代码-Data Structures and Algorithm Analysis, a book-building code splaytree
SplayTree
- A C++ implementation of Splay Tree.
SplayTree
- A splay tree is a self-adjusting binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look-up and removal in O(log n)
crisscross-latest.tar.tar
- CrissCross是一种小型的跨平台C + +库，用于处理控制台和文件I / O ， CPU的识别（ CPUID ） ，散列（ MD2 ， MD4 ， MD5编码，了SHA - 1 ，SHA- 256 ，SHA- 512 ，Tiger） ，Socket（ TCP和目前唯一的UDP ）和数据结构（ LList ， DArray ， RedBlackTree ， AVLTree ， SplayTree等） 。其目的是运行在Windows
splaytree
- 从自顶向下和自下向上两种方法实现了伸展树的全部功能 如插入 查找 删除 合并 分裂-Tree stretching from the top-down and bottom-up are two ways to achieve all of the features, such as the insertion Find deleted merger split
project1
- 一个程序用于比较AVLTREE，SPLAYTREE以及普通的UNBALANCED BINARY SEARCHTREE之间的插入和删除的time的代码，可用于研究测试。-A program used to compare AVLTREE insertion and deletion time of SPLAYTREE ordinary the UNBALANCED BINARY SEARCHTREE between code that c
splaytree
- 标准数据结构splaytree的C语言实现，很规范，供参考-The standard of data structure splaytree the C language specifications for reference