Location:
Search - splay tree
Search list
Description: splay tree 源碼splay tree 源碼
Platform: |
Size: 1407 |
Author: qweqaz |
Hits:
Description: 伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long,
this structure only is useful is may separate the tree
Platform: |
Size: 5120 |
Author: |
Hits:
Description: 主要是avl,splay和binary树的insert,delete程序,主要是avl,splay.binary树的-mainly AVL, SED and the binary tree insert, delete procedures, mainly AVL, splay.binary tree
Platform: |
Size: 3072 |
Author: 往常 |
Hits:
Description: 对三种数据结构的分析.avl tree,splaytree和binary search tree的插入和删除的算法复杂度分析.-of three data structure analysis. Avl tree, splaytree and binary search tree insertion and deletion algorithm complexity analysis .
Platform: |
Size: 3072 |
Author: 王佩君 |
Hits:
Description: Lossless Data Compression Toolkit Version 1.1 of the lossless data compression toolkit by Nico deVries. The C sources in this toolkit include an LZW compressor, AR002 archiver, a PPM like compressor using arithmetic compression, Huffman compressor, splay tree program, and LZRW1. Quite a variety. -Lossless Data Compression Toolkit Versio n 1.1 of the lossless data compression toolkit b y Nico deVries. The C sources in this toolkit inc lude an LZW compressor, AR002 archiver. PPM like a compressor using arithmetic compres sion, Huffman compressor, splay tree program, and LZRW1. Quite a variety.
Platform: |
Size: 96256 |
Author: jason.. |
Hits:
Description: 伸展树
都知道如果使用二叉查找树树平衡度不好则会降低查询效率，所以我们要维护二叉树的平衡性，即TreapTree 、SplayTree 、AVL、红黑等，本文介绍伸展树的平衡原理和核心代码
-Tree stretching all know if you use binary search tree tree balance will not reduce the query efficiency, and therefore we have to safeguard the balance tree that TreapTree, SplayTree, AVL, red and black, etc. This article describes the principle of extending the balance of the tree and the core code
Platform: |
Size: 188416 |
Author: sql |
Hits:
Description: 一个数据结构的课程作业，用来比较avltree，splay tree，平衡树之间的插入删除操作的时间，平均时间，内有这3种树的实现代码-A data structure course operations, to compare avltree, splay tree, balanced tree insertion between the delete operation time, average time, which has 3 planting the realization of this code
Platform: |
Size: 62464 |
Author: 卢杨 |
Hits:
Description: 红黑树是一种自平衡二叉查找树，是在计算机科学中用到的一种数据结构，典型的用途是实现关联数组。-AVL trees are actually easier to implement than RB trees because there are fewer cases. And AVL trees require O(1) rotations on an insertion, whereas red-black trees require O(lg n).
In practice, the speed of AVL trees versus red-black trees will depend on the data that you re inserting. If your data is well distributed, so that an unbalanced binary tree would generally be acceptable (i.e. roughly in random order), but you want to handle bad cases anyway, then red-black trees will be faster because they do less unnecessary rebalancing of already acceptable data.On the other hand, if a pathological insertion order (e.g. increasing order of key) is common, then AVL trees will be faster, because the stricter balancing rule will reduce the tree s height.
Splay trees might be even faster than either RB or AVL trees,depending on your data access distribution. And if you can use a hash instead of a tree, then that ll be fastest of all.
Platform: |
Size: 8192 |
Author: kark |
Hits:
Description: A C++ implementation of Splay Tree.
Platform: |
Size: 3072 |
Author: lionmoa |
Hits:
Description: Splay tree implementation data structures
Platform: |
Size: 1024 |
Author: abcdefglksl |
Hits:
Description: Splay Tree，伸展树，一种实现简单的平衡二叉树，增删改查的时间复杂度均为O(logN）-Splay Tree
Platform: |
Size: 653312 |
Author: liuyulei |
Hits:
Description: 根据Kurse版数据结构书改成的电子版课件。此章包括二叉树的概念，结构，遍历，线索二叉树，二叉搜索树，平衡二叉树，splay树-According to the data structure Kurse version of the book into electronic version of the courseware. This chapter includes the concept of binary tree structure, traversal, threaded binary tree, binary search tree, balanced binary tree, splay tree
Platform: |
Size: 579584 |
Author: 黄蔼婧 |
Hits:
Description: Splay 伸展树 HDU 3487模板-Splay tree HDU 3487 template extension ...
Platform: |
Size: 1024 |
Author: xyh |
Hits:
Description: Splay tree in C language
Platform: |
Size: 2048 |
Author: ramya |
Hits:
Description: splay tree，动态平衡树的一种，应用比较灵活-splay tree, the dynamic balance of a tree, the application is more flexible
Platform: |
Size: 2048 |
Author: 可可 |
Hits:
Description: 伸展树Splay在数列处理问题上的应用的教程与源代码，含有pas和cpp。-A director of Splay tree for the usage to solve the problem with number list
Platform: |
Size: 274432 |
Author: chen andy |
Hits:
Description: progrm for splay tree in C
Platform: |
Size: 1024 |
Author: Zeeshan |
Hits:
Description: 伸展树，在Linux内核红黑树基础上修改自行完成的伸展树。-Splay tree program code
Platform: |
Size: 12288 |
Author: 张 |
Hits:
Description: The major feature of splay trees is that all basic tree operations are amortized O(log n) time for a tree with n nodes.
Platform: |
Size: 2048 |
Author: weidtfin |
Hits:
Description: 伸展树入门必备,包含了几个入门伸展树的经典题目的详细题解(Splay tree entry must contain detailed notes several classic title entry tree stretch of the)
Platform: |
Size: 3072 |
Author: axuhongbo
|
Hits: