搜索资源列表
Splaytree
- 伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree
manytrees
- 常用树数据结构集合，包括二叉树、二叉查找树、AA树、红黑树、伸展树的一整套实现，自带包装器、异常处理类，方便使用-common pool tree data structure, including the binary tree, binary search tree, AA tree, a red, black tree extend to achieve a set of trees, bringing their wrapper
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
manytrees
- 常用树数据结构集合，包括二叉树、二叉查找树、AA树、红黑树、伸展树的一整套实现，自带包装器、异常处理类，方便使用-common pool tree data structure, including the binary tree, binary search tree, AA tree, a red, black tree extend to achieve a set of trees, bringing their wrapper
Splay
- 伸展树 都知道如果使用二叉查找树树平衡度不好则会降低查询效率，所以我们要维护二叉树的平衡性，即TreapTree 、SplayTree 、AVL、红黑等，本文介绍伸展树的平衡原理和核心代码 -Tree stretching all know if you use binary search tree tree balance will not reduce the query efficiency, and therefore
draw-tree
- 伸展树，基本数据结构，The tree is drawn in such a way that both of the edges down from a node are the same length. This length is the minimum such that the two subtrees are separated by at least two blanks.-The tree is drawn in suc
tree
- 主要是针对搜索树，平衡树，伸展树的插入删除，搜索的时间比较，以及操作代码。-Mainly for the search tree, balanced tree, the tree stretch insert delete, search time, as well as the operation code.
Splay
- Splay Tree，伸展树，一种实现简单的平衡二叉树，增删改查的时间复杂度均为O(logN）-Splay Tree
slaytree
- 伸展树的设计与实现 可用 欢迎大家学习 共同进步 -slay tree
TreeAlg
- c++ 伸展树（splay） B-树的实现源码-c++ extension tree (splay) B-tree to achieve source
BST1
- 运用伸展树的特性，每次插入新的结点后，调用展开函数，使得新结点成 为所建树的根结点。-Use of the characteristics of the splay tree, each time you insert a new node, call to function, making the new node into For the achievements of the root.
Splay_tree
- Splay树(伸展树)数据结构及简单运用，用C++实现，适合学习-Splay tree
splay
- 利用伸展树完成对数列的维护 包括插入删除翻转求最大子序列和 任意位置后n个位置和等功能-Stretch tree complete after a series of maintenance, including to insert delete Flip seeking the largest sub-sequences and anywhere n positions and other functions
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
splay_sqybi
- splay 伸展树 binary search tr-splay binary search tree
splay
- splay 伸展树 还不错的代码，大家可以-the splay stretch tree also good code, we can see
The_Magical_Splay
- Splay 伸展树经典教程，含有论文和源代码。ACM金牌必备。-A Splay tree director for ACMer who wants to get a medal,include PDF and souce code
Splay
- 伸展树入门必备,包含了几个入门伸展树的经典题目的详细题解(Splay tree entry must contain detailed notes several classic title entry tree stretch of the)
splay tree
- 伸展树的基本操作 包括插入、查找、删除、遍历(The basic operation of the stretching tree Including insert, find, delete, traverse)