Search - balance tree

Search - balance tree - List

[Data structs] BST BBT DL : 0: 数据结构大型作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T's average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of the outstanding balance of two fork-tree and balanced binary tree s
Date : 2026-01-08 Size : 4kb User : 洪玲叶
[Data structs] 平衡二叉树c++ DL : 0: 平衡二叉树生成输入任意个节点如 2 6 8 0为显示可自动生成平衡二叉树 bf为平衡因子 h给深度可插入删除计算转动次数（wangliwei007也是我，质料没添全就换这个好号，请斑竹给我发个号好吗？我也想下载东西，急）-balanced binary tree generating arbitrary input nodes as 2 6 8 0 to demonstrate that automatically generates balanced binary tree bf for the balance factor to the depth h can be inserted delete calculated rotational frequency (wangliwei007 me, not Tim material on the whole good for this, please give me a 62-000, okay? I would also like to download something radical)
Date : 2026-01-08 Size : 2kb User : 王立伟
[Data structs] BalTree DL : 0: 平衡树基类.可以通过继承重载建立自己需要的平衡树结构-balance tree base class. Heavy succession through the establishment of their own needs, the balance tree structure
Date : 2026-01-08 Size : 4kb User : lk
[Data structs] ImpleOfDataStruct DL : 0: 数据结构的实现，包括可自动增长的数组，链表，堆栈，集合，二叉搜索树（元素不会重复），AVL 平衡树等，很好的数据结构源码。所有类均使用模板编写，并不特定于 Windows 平台，所有只要有 C++ 编译程序的操作平台都可使用。-achieve the data structure, including the automatic growth of arrays, linked lists, stacks, collection, Binary Tree Search (elements will not repeat), AVL tree balance, a good source of the data structure. All categories were prepared using templates is not specific to the Windows platform. as long as all have the C compiler platform can be used.
Date : 2026-01-08 Size : 33kb User :
[Data structs] Balance-Bi-Tree DL : 0: 数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tr-data structure Balance- Bi-Tree data structure Balance- Bi-Tr ee data structure Balance- Bi-Tree data structure Balance- Bi-Tr
Date : 2026-01-08 Size : 7kb User : yang
[Data structs] Russian-fang-kuai DL : 0: 数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tr-data structure Balance- Bi-Tree data structure Balance- Bi-Tr ee data structure Balance- Bi-Tree data structure Balance- Bi-Tr
Date : 2026-01-08 Size : 4kb User : yang
[Data structs] RedBlackTree DL : 0: red black tree.balance binary tree.the souce code-red black tree.balance binary tree.the so uce code
Date : 2026-01-08 Size : 35kb User : Rechird
[Data structs] pinghengerchashu DL : 0: 基本思想是在构造二叉检索树的过程中，当插入一个接点后都去检查是否由于该接点的插入而破坏了二叉检索树的平衡性；若出现绝对值超过1的平衡因子，则需要在保持二叉检索树特性的前提下通过调整使之达到新的平衡。-The basic idea is to construct binary tree search process, when inserted after a contact to check whether it was due to the insertion point and destroyed the binary search tree balanced If the absolute value of the balance of more than one factor, you need to maintaining binary search trees under the premise of properties by adjusting so that they will reach a new equilibrium.
Date : 2026-01-08 Size : 1kb User : chenweihuan
[Data structs] Splay DL : 0: 伸展树都知道如果使用二叉查找树树平衡度不好则会降低查询效率，所以我们要维护二叉树的平衡性，即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
Date : 2026-01-08 Size : 184kb User : sql
[Data structs] AVLtree DL : 0: 经典数据结构算法实现平衡二叉树的建立和维护-Classical data structure binary tree algorithm to achieve a balance of the establishment and maintenance of
Date : 2026-01-08 Size : 272kb User : nido
[Data structs] avt DL : 0: 1.本程序演示平衡二叉树的插入,删除,查找,。 2.首先要先初始二叉树为空树； 3.接着要实现平衡二叉树的插入，删除，，其中根据平衡二叉树插入，删除的算法要不停的把插入的元素平衡地插入，需要调用平衡分析函数和左右旋转函数，更新平衡二叉树；删除元素后也要调用平衡分析函数和左右旋转函数，更新平衡二叉树。 4.平衡二叉树的查找则可根据查找算法实现。比较简单。-1. This procedure demonstration balanced binary tree insertion, delete, find,. 2. First of all, the initial first binary tree is empty tree 3. And then to achieve a balanced binary tree insertion, deletion, which under the balanced binary tree insertion, deletion of the algorithm to keep the inserted element balanced insertion, the need to call about a balanced analysis of function and rotating functions, balanced binary tree update delete elements have to call after the balance analysis functions and rotation function, update the balance tree. 4. Balanced binary tree can be the basis of the search algorithm to find. Relatively simple.
Date : 2026-01-08 Size : 254kb User : 张欣
[Data structs] avl_Tree DL : 0: 一个用C++实现的平衡二叉树算法，实现了高度、平衡度、父子节点等-A use of C++ to achieve a balanced binary tree algorithm, to achieve a high degree of balance, such as father and son nodes
Date : 2026-01-08 Size : 565kb User : liao
[Data structs] balance_tree DL : 0: 平衡二叉树的各种算法，如节点的删除，插入，查找等-balance tree
Date : 2026-01-08 Size : 3kb User : 菜鸟
[Data structs] Balance-binary-tree DL : 0: 主要讲述平衡二叉树，以及linux内核的二叉树的红黑平衡二叉树的应用-Balance binary tree
Date : 2026-01-08 Size : 1kb User : 曾梦
[Data structs] balanced-bianary-tree--traversal DL : 0: 平衡二叉树的遍历，左旋，右旋，左平衡，右平衡-Balanced binary tree traversal, L, D, left a balance, the right balance
Date : 2026-01-08 Size : 2kb User : 花格子
[Data structs] balance-tree DL : 0: 平衡树算法的实现，功能为平衡树算法的实现-balance tree
Date : 2026-01-08 Size : 1kb User : 宗畅
[Data structs] AVLTree DL : 0: 二叉平衡树的删除，并可以调整平衡，还有平衡二叉树的插入操作-Binary balance tree to delete, and can adjust the balance
Date : 2026-01-08 Size : 19kb User : dgy
[Data structs] Balance-two-forks-tree DL : 0: 将二叉排序树转变为平衡二叉树，其操作有:创建二叉树、插入数据、删除数据、输出、销毁二叉树和退出 -Binary sort tree into a balanced binary tree, its operations are: create a binary tree, insert data, delete data, output, the destruction of the binary tree and exit
Date : 2026-01-08 Size : 24kb User : wanshaui
[Data structs] balance-tree DL : 0: 数据结构中对平衡二叉树的算法描述，自己编写的，不足之处见谅-balance tree
Date : 2026-01-08 Size : 2kb User : 月出
[Data structs] UserCheckIn DL : 0: 编程实现二叉树结构及其相关功能，以存储用户信息，不使用标准模板类的二叉树结构和函数。同时根据二叉树的变化情况，进行相应的平衡操作，即AVL平衡树操作，四种平衡操作都考虑。采用相应的数据结构模拟用户登录系统，其功能包括用户登录、用户密码更新、用户添加和用户删除等。(The programming implements the two fork tree structure and its related functions to store user information and do not use the two forked tree structure and function of the standard template class. At the same time, according to the change of two forked trees, the corresponding balance operation is carried out, that is, the AVL balance tree operation, and the four kinds of balance operation are considered. The user login system is simulated with the corresponding data structure. Its functions include user login, user password update, user addition and user deletion.)
Date : 2026-01-08 Size : 1.82mb User : lalala2333

« 12 3 »