搜索资源列表
平衡二叉树操作的演示
- 平衡二叉树实现一个动态查找表,有三种基本功能:查找,插入删除,还有选项功能:合并两棵平衡二叉树,和分裂两棵平衡二叉树.-balanced binary tree to achieve a dynamic lookup table, there are three basic functions : to find, delete, insert, functional options : merging two balanced binary tree, and split two balanc
ld
- 利用平衡二叉树实现一个动态查找表 实现动态查找表的三种基本功能:查找、插入和删除
23442
- 实现二叉树的中序，先序，后序三种遍历的功能。-Binary tree in order to achieve first order, the order of three kinds oftraversal functions.
tree
- 本程序可以用三种方法建立二叉树，并实现相应功能。1、通过输入树的嵌套括号表示序列建立二叉树；2、根据前序遍历序列和中序遍历序列建立二叉树；3、建立哈夫曼树-This program can use three ways to establish a binary tree, and to achieve that function. 1, by entering the tree to establish a sequence of nested parentheses binary tree
moban
- 二叉树实现，主要实现树的三种遍历和删除。查找功能等-Implementation of binary tree，Implementation of binary tree，After the first sequence order in order to find, delete, traverse and review
Bitree
- 本程序的功能是：首先在二叉树的头文件中定义了二叉树的创建、插入、删除、三种遍历方式等，在主程序中则调用头文件来对创建的二叉树实现前序、中序、后续遍历，并打印最后遍历的结果。-The function of this program are: first define several operation of the binary treein the header file , including creating , inserting, deleting, and three trave
balanceTree
- 本实验主要是平衡二叉树操作的演示。具体实现了动态查找表的三种基本功能：查找、插入和删除。-This experiment is the demonstration of the balanced binary tree.Concrete realization of a dynamic look-up table of the three basic functions: find, insert and delete.