Description: 基本思想是在构造二叉检索树的过程中，当插入一个接点后都去检查是否由于该接点的插入而破坏了二叉检索树的平衡性；若出现绝对值超过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. Platform: |
Size: 1024 |
Author:chenweihuan |
Hits:
Description: 平衡二叉树是数据结构中一个非常重要的概念。它对二叉树的优化和提高查询效率有重要的作用，它是动态查找的一个非常重要方法，它在实际生产中有着广泛的应用。
-
Balanced binary tree data structure is a very important concept. Its binary tree query optimization and improve efficiency has an important role, it is a dynamic search of a very important method, which in the actual production has a broad application.， Platform: |
Size: 2048 |
Author:王艳峰 |
Hits:
Description: 用二叉链表作存储结构
(1)以回车(‘\n’)为输入结束标志,输入数列L，分别生成一棵二叉排序树T和平衡的二叉排序树BT ；
(2)对二叉排序树T作中序遍历，输出结果；
(3)输入元素x,查找二叉排序树T:若存在含x的结点,则删除该 结点,并作中序遍历(执行操作2)；否则输出相关信息；
(4)分别计算T、BT的查找成功的平均查找长度,输出结果；
-List for storage with the two fork structures (a) to carriage return ( ' \ n' ) for the input end of the symbol, enter the number of columns L, respectively, generating a binary sort tree T and balanced binary sort tree BT (2) right two binary sort tree T in order to make traversal, the output results (3) input element x, to find two binary sort tree T: if there exists node containing x, then delete the node, and for medium-order traversal (to perform operations 2 ) otherwise, the output-related information (4) were calculated T, BT Find the average successful search length, the output results Platform: |
Size: 450560 |
Author:肖胜鹏 |
Hits:
Description: 随机生成用户要求个数的整数，生成二叉树（无重复），
可以进行生成、遍历、查找二叉树，而且进行动态的查找，
如果没有找到节点就把这个值接到树上
能够显示节点的产生顺序、平衡因子（失败），节点值-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 Platform: |
Size: 2048 |
Author:李峰 |
Hits:
Description: 本文详细解说了平衡二叉树算法，很好的原创学习材料-This detailed explanation of the balanced binary tree algorithm, very good original learning materials Platform: |
Size: 143360 |
Author:zrx2 |
Hits:
Search - pinghengerchashu