Search - Treap - CodeBus

Search - Treap - List

[JSP/Java] Treap DL : 0: 实现TREAP，有兴趣可以看一下-achieve TREAP are interested can look at.
Date : 2008-10-13 Size : 2.02kb User : 沉郁
[Other] Treap DL : 0: 我用Pascal写的平衡二叉树的Treep算法，既Tree+Heap的算法，效率相对AV算法不差不多，可以参考
Date : 2008-10-13 Size : 813byte User : 彭立勋
[Other resource] data_structures DL : 0: 一些重要的数据结构，有堆，平衡树treap，并查集等。
Date : 2008-10-13 Size : 1.73kb User : Gragon
[Data structs] CodeWin DL : 0: Data Structures and Algorithm Analysis in Java -- Source Code-Data Structures and Algorithm Analysis in Java-- Source Code
Date : 2025-07-02 Size : 148kb User : 笑容
[JSP/Java] Treap DL : 0: 实现TREAP，有兴趣可以看一下-achieve TREAP are interested can look at.
Date : 2025-07-02 Size : 2kb User : 沉郁
[Other] E64_0230 DL : 0: 平衡二叉树操作的演示一、需求分析（1）利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。（2）初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。（3）重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Insert the available balance transform inverse transform.
Date : 2025-07-02 Size : 40kb User : 苏言暖
[Other] Treap DL : 0: 我用Pascal写的平衡二叉树的Treep算法，既Tree+Heap的算法，效率相对AV算法不差不多，可以参考
Date : 2025-07-02 Size : 1kb User : 彭立勋
[Data structs] data_structures DL : 0: 一些重要的数据结构，有堆，平衡树treap，并查集等。-Some important data structures, there are a heap of tree balance treap, and check books.
Date : 2025-07-02 Size : 1kb User : Gragon
[Other] treap DL : 0: treap的c++实现。有良好的可读性。并且多次验证了可行性-treap of c++ achieve. Good readability. And repeatedly verified the feasibility of
Date : 2025-07-02 Size : 119kb User : huangxin
[Data structs] 3481_treap DL : 0: 一个数据结构的程序，treap的实现，其实是PKU上的一个题3481-treap
Date : 2025-07-02 Size : 1kb User : 冯锦
[Other] Balanced_Tree_Code DL : 0: 平衡树代码大全，有treap和SBT两种平衡树的完整代码-Code Complete, balanced tree, with two balanced tree SBT treap and the complete code
Date : 2025-07-02 Size : 1kb User : wrs
[Data structs] SPOJ3273_treap DL : 0: 数据结构Treap的C++实现，时间复杂度nlogn-Data structure Treap the C++ implementation, the time complexity nlogn
Date : 2025-07-02 Size : 1kb User : liuzhongxin
[Data structs] Treap DL : 0: Treap C++模板类实现了treap数据结构同时具有堆和二叉树的性质-Treap C++ template class implements the treap data structure of both the nature of the heap and binary tree
Date : 2025-07-02 Size : 2kb User : nigoe
[Printing program] Treap DL : 0: 将二叉堆树在控制台下调用 api 函数用图形树打印，-The binary tree in the control of the tree with graphic print
Date : 2025-07-02 Size : 3.22mb User : 弄颖
[TreeView] treap DL : 0: Treaps.rar Treap is between tree and heap
Date : 2025-07-02 Size : 154kb User : enganasb
[SCSI-ASPI] New-Text-Document-(2) DL : 0: TREAP C== THE GIOO BY SI=UBMITION OR FUCKINF THAT
Date : 2025-07-02 Size : 1kb User : saria
[Software Engineering] Size-Balance-Tree-and-Treap-ADT DL : 0: Size Balance Tree和Treap的ADT接口和实现，使用心得和大家分享一下-Size Balance, Tree and Treap the ADT interface and implementation, use the experience and share with you
Date : 2025-07-02 Size : 7kb User : jinhui
[Data structs] treap DL : 0: treap代码，pascal实现，信息学竞赛必备-treap code, pascal achieved informatics contest essential
Date : 2025-07-02 Size : 1kb User : wangyi
[Data structs] Treap DL : 0: 数据结构treap实现的一个class模板，实现简单高效易懂-Treap a class template data structure implemented, simple to understand and efficient
Date : 2025-07-02 Size : 1kb User : czz
[Console] Treap DL : 0: 树堆，实现树堆的插入删除查找最大最小前驱后继和遍历功能-Tree heap, heap insert delete search tree to achieve the maximum and minimum precursor of subsequent and traversal functions
Date : 2025-07-02 Size : 1.67mb User : kwind

« 12 »