Description: 用 java实现的 搜索二叉树的插入、删除、遍历和平衡，是自己用与数据结构考试编写的 ，对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming Platform: |
Size: 1797 |
Author:记忆超 |
Hits:
Description: 数 据 结 构 大型 作业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 Platform: |
Size: 4096 |
Author:洪玲叶 |
Hits:
Description: Addison-Velski 和 Landis (AVL-Tree s)的二叉树，可以在对数时间内进行标准的操作，如插入、搜索和删除。-Addison-Velski and Landis (AVL- Tree s) of the binary tree, the right time for a few of the standard operation, such as insert, delete and search. Platform: |
Size: 969728 |
Author:倪玲 |
Hits:
Description: This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially contains "space" characters only. Read several letters from the file to the buffer. Then search the buffer for the longest string that matches the letters just read, and send its length and position in the buffer. Platform: |
Size: 3072 |
Author:冰冰 |
Hits:
Description: 二叉排序树的查找算法，用非递归做的，查找删除节点等操作-Binary Tree Search ranking algorithm, the use of non- recursive so that you delete nodes, etc Platform: |
Size: 163840 |
Author:苗建新 |
Hits:
Description: 二叉树的一般操作:
1. 判断二叉树是否为空。
2. 搜索二叉树中的某一项。
3. 在二叉树中插入一项。
4. 从二叉树中删除一项。
5. 求二叉树的高度。
6. 求二叉树的节点数量。
7. 求二叉树的叶节点数量。
8. 遍历二叉树。
9. 复制二叉树。
-binary tree : 1. To judge whether the binary tree is empty. 2. Binary Tree Search of a one. 3. The insertion of a binary tree. 4. From a binary tree removed. 5. For binary tree height. 6. For binary tree node number. 7. For binary tree leaf node number. 8. Traverse binary tree. 9. Replication binary tree. Platform: |
Size: 109568 |
Author:刘炎黄 |
Hits:
Description: 叉排序树与平衡二叉排序树基本操作的实现
用二叉链表作存储结构
(1)以回车( \n )为输入结束标志,输入数列L,生成二叉排序树T；
(2)对二叉排序树T作中序遍历,输出结果；
(3)计算二叉排序树T的平均查找长度,输出结果；
(4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结
点,并作中序遍历(执行操作2)；否则输出信息“无结点x”；
(5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and balanced binary tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \ n) to mark the end of the importation, importation of L series, generate binary tree Sort T; (2) Ranking of two forks to make the tree T preorder, and the output results; (3) Calculations binary tree T ranking on the average search length, output; (4) Input elements x, find two tree fork Sort T, if x exists with the node, then remove the nodes, and make the preorder (execution 2); Otherwise output "node x"; (5) to determine the order of two trees T fork whether balanced binary tree, and the output message "OK!"/"NO!" ; Platform: |
Size: 2048 |
Author:胡图 |
Hits:
Description: 常用树数据结构集合，包括二叉树、二叉查找树、AA树、红黑树、伸展树的一整套实现，自带包装器、异常处理类，方便使用-common pool tree data structure, including the binary tree, binary search tree, AA tree, a red, black tree extend to achieve a set of trees, bringing their wrapper, abnormal class, user-friendly Platform: |
Size: 13312 |
Author:esonic |
Hits:
Description: 用 java实现的 搜索二叉树的插入、删除、遍历和平衡，是自己用与数据结构考试编写的 ，对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming Platform: |
Size: 2048 |
Author:记忆超 |
Hits:
Description: 程序包括了平衡二叉树的查找,插入,删除,合并等操作-Procedures, including the balanced binary tree search, insert, delete, merge, such as operation Platform: |
Size: 3072 |
Author:李 |
Hits:
Description: This program creates a binary Search Tree, traverse it in pre, post and inorder and also create the mirror image of the binary tree. Platform: |
Size: 1024 |
Author:Raj |
Hits:
Description: 这是一个有关二叉树查找类，总的来说比较好用-This is a binary tree to find the class, are generally more easy to use Platform: |
Size: 23552 |
Author:xiao feng |
Hits:
Description: 在对二叉树存储结构进行分析的基础上，介绍二叉树遍历算法的一种应用，即基于求解二叉树深度算法设计实
现的搜索二叉树中最长路径的算法。这里详细介绍了搜索二叉树中最长路径问题的分析解决思路，在对可能的预期结果进
行分析的基础上，给出了算法的设计方案，同时给出了具体的C语言算法描述。-By analyzing the storage structure of binary tree，a kind of application of binary tree traversal algorithm，that
is，the algorithm of searching the longest path in binary tree，which is realized by solving the depth of binary tree，is intro—
duced．The solution ideas of searching the longest path in binary tree are proposed in detail．The design scheme of the algorithm
is given by analysing the expected results．The algorithm description in C language is presented． Platform: |
Size: 262144 |
Author:陈晓娟 |
Hits:
Description: 利用分类二叉树查找及堆排序实现学生成绩管理 -Classification of binary tree search and sort heap of student achievement management Platform: |
Size: 311296 |
Author:the spring |
Hits:
Description: 该代码是实现单总线器件的二叉树搜索功能的rom程序。-The code is a binary tree search function to achieve a single-bus device rom program. Platform: |
Size: 1024 |
Author:张丽华 |
Hits:
Description: 该程序主要是针对平衡二叉树的操作而设计的，程序执行的命令包括：
（1）构造平衡二叉树；（2）输入数据；
（3）对平衡二叉树的查找、插入、删除操作；（4）结束
-The program is mainly aimed balanced binary tree operation and design, program execution commands include: (a) construct a balanced binary tree (2) the input data (3) on the balanced binary tree search, insert, delete operations (4) the end of the Platform: |
Size: 2048 |
Author:张妍 |
Hits:
Search - binary tree search