Search - balance tree

Search - balance tree - List

[Other] genBST DL : 0: 通用二叉搜索树，包含的算法有：输出广度优先遍历、前序、中序、后序遍历结果，按树的形状打印树，统计总节点数，统计叶子节点数，统计右节点数，计算树的高度，删除所有叶子节点，插入节点，查找节点，删除节点，由前序遍历结果和中序遍历结果生成树，由后序遍历结果和中序遍历结果生成树，检查该树是否平衡和完全平衡。-generic binary search tree contains the algorithm are : output breadth- first traversal, the former sequence, sequence, after the preorder, the shape of the tree by tree print, the total number of nodes statistics, statistics leaf nodes, the nodes to the right statistics to calculate tree height, remove all leaf nodes, insert nodes, the nodes you delete nodes from the former preorder results and the results of Spanning Tree preorder, After the preorder from the results and the results preorder spanning tree, check whether the tree balanced and complete balance.
Date : 2026-01-09 Size : 307kb User : 雷剑
[Other] BalanceTree DL : 0: 平衡树，包括平衡树的创建，按照树的形状打印-tree balance, including the balance of the tree is created, in accordance with the shape of the tree Print
Date : 2026-01-09 Size : 597kb 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 : 2026-01-09 Size : 40kb User : 苏言暖
[Other] avl DL : 0: avl平衡树做的电话号码系统！！！可支持查询，修改，删除等操作-AVL tree balance of the telephone numbering system to do! ! ! Support query, modify, delete and other operations
Date : 2026-01-09 Size : 3kb User : jiangshan
[Other] Tree DL : 0: 关于树的各种操作，建立，遍历，删除，平衡，排序树，哈弗曼树等操作-Various operations on the tree, create, iterate, delete, balance, order trees, trees and other operations Havermann
Date : 2026-01-09 Size : 677kb User : 风清扬
[Other] NOI2007cash DL : 0: NOI2007cash一题使用平衡树以及单调性优化，n lg n，非常神奇-NOI2007cash a title using the balance tree and monotony, n lg n, very magical
Date : 2026-01-09 Size : 3kb User : wrs
[Other] balancetree DL : 0: balance tree program in C
Date : 2026-01-09 Size : 1kb User : Merec
[Other] BiSrchTrBalanced DL : 0: 平衡二叉树的c语言实现，在codeblocks可运行-Balance binary tree c language implementation, in codeblocks can run
Date : 2026-01-09 Size : 19kb User : 张水梅
[Other] balance-tree DL : 0: 平衡二叉树的程序，C++实现，当时写了一天-The the balanced binary program, C++ achieve was written the day
Date : 2026-01-09 Size : 2kb User : 陈星星
[Other] pinghengerchashu DL : 0: 随机生成用户要求个数的整数，生成二叉树（无重复），可以进行生成、遍历、查找二叉树，而且进行动态的查找，如果没有找到节点就把这个值接到树上能够显示节点的产生顺序、平衡因子（失败），节点值-Randomly generated integer number of user requirements, generate a binary tree (no duplicates), can be generated, traverse Find a binary tree, and dynamic lookup If you did not find the node received a tree to be able to put the value of the order in which the nodes generate balance factor (failure), the value of a node
Date : 2026-01-09 Size : 2kb User : 李峰
[Other] balance DL : 0: 平衡二叉树的实现数据结构编程习题原创代码仅供参考-The realization of the balanced binary tree data structure programming exercises original code for reference only.
Date : 2026-01-09 Size : 1kb User : 韩默
[Other] Unit-Nine DL : 0: 输入n个两两互不相等的整数，以这些整数为关键字建立平衡的二叉排序树。判断该二叉树是否为平衡的，输出判断结果；输出该二叉树的中序遍历关键字访问次序。-Enter an integer n pairwise distinct and so on, in order to establish a balance of these integer binary sort tree as a keyword. Determine whether the binary tree is balanced, the judgment result output output of the binary tree traversal key access order.
Date : 2026-01-09 Size : 1kb User : 林美蓉
[Other] balancedtree DL : 0: C语言实现的平衡二叉树基本操作，包括插入，旋转，删除。-C language to achieve the balance of the binary tree basic operations, including insert, spin, delete.
Date : 2026-01-09 Size : 1kb User : fjf
[Other] BalancedBinaryTree DL : 0: 平衡二叉树构造，由C++编程，全部测试通过，华为面试原题-Balance binary tree
Date : 2026-01-09 Size : 5kb User :
[Other] IsBalanceTree DL : 0: 判断是否是平衡二叉树。导入eclipse时package classTwo 更改包名，-Is Balance Tree
Date : 2026-01-09 Size : 1kb User : wliuxingxiangyu
[Other] IST1HasT2 DL : 0: 判断树T1是否是包含树T2。导入eclipse时package classTwo 更改包名，-Is T1 Has T2 Balance Tree
Date : 2026-01-09 Size : 1kb User : wliuxingxiangyu
[Other] AVL DL : 0: 二叉平衡搜索树，实现了插入算法，并且每次插入之后还是二叉平衡搜索树，并且显示平衡因子-Balanced binary search tree insertion algorithm realized, and after insertion or balanced binary search tree every time, and displays the balance factor
Date : 2026-01-09 Size : 2kb User : 洪春