搜索资源列表
splayTree
- 主要是avl,splay和binary树的insert,delete程序,主要是avl,splay.binary树的-mainly AVL, SED and the binary tree insert, delete procedures, mainly AVL, splay.binary tree
TreeAlg
- c++ 伸展树(splay) B-树的实现源码-c++ extension tree (splay) B-tree to achieve source
splay-tree
- 划分树logn 给你n个数 然后让你query从ll到rr中排第k的数-N logn to you by the number of trees and then let you query from ll to rr in the number of rank k
The_Magical_Splay
- the describe of Splay Tree in chinese it may help you to learn the Splay Tr-the describe of Splay Tree in chinese it may help you to learn the Splay Tree
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.
cprops
- The cprops (C prototyping tools) library provides a portable, thread-safe C API including linked list, binary heap, priority queue, hash table, hash list, trie, AVL, Red-Black, and splay tree implementations, a thread pool and thread management fra
Splay_tree
- Splay树(伸展树)数据结构及简单运用,用C++实现,适合学习-Splay tree
splay
- 强大的数据结构--splay。splay是一种简洁易写的平衡树。splay在ACM竞赛中用重要的应用。-Powerful data structure- splay. splay is a simple and easy to write a balanced tree. splay ACM contest with important applications.
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
splay_sqybi
- splay 伸展树 binary search tr-splay binary search tree
code
- 完成二叉树、AVL树、Splay树的操作,并比较这三种树在插入删除一连串元素时的效率-Compare the performances of a sequence of insertions and deletions on Binary search tree, AVL tree, Splay 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
- Generate Payload Tree for java.
DP
- 随着动态规划在 OI 中的广泛运用,动态规划问题已经不再停滞于能够写出 方程就能得到完美解答。如今考察我们的对于动态规划的运用往往是考察动态规 划的优化,也就是降维。我们已经知道维护方程中的决策可以选择用数据结构进 行优化,比如:Splay、线段树,等等。这样的优化仅能将方程的时间复杂度下 降一个 LogN 的级别。如果 N 的范围相当大,即使下降一个 LogN 的级别也依然 超时呢?我们引进一种更强的优化——斜率优化。-With the extensive use of d
data-structure
- 提供Splay、SBT、线段树、动态树等数据结构的模板,方便直接套用-The structure of data provided by Splay, SBT, dynamic segment tree, tree template, convenient to directly use
BST1
- 运用伸展树的特性,每次插入新的结点后,调用展开函数,使得新结点成为所建树的根结点。-Use of the characteristics of the splay tree, each time you insert a new node, call to function, making the new node intoFor the achievements of the root.
AVL_Splay_Tree
- BST,AVL,SPlay Tree的C语言实现,并测试三者的性能。 包括三种树的具体实现和test程序。-BST,AVL,SPlay Tree accomplishment based on C,and test them. Including test source file and tree source file.