搜索资源列表
tree
- 该程序的功能为已知二叉树中序遍历和后序遍历序列，求二叉树的二叉链表结构，程序中假设前序序列和中序序列已经分别储存在数组Pre和In中，由子树的前序和中序序列建立其二叉链表，在中序序列中查找子树根，计算左右子树的大小，置队列为空队列，输出左右孩子并入队列中
BinaryTreeoperation
- 二叉树的前序中序后序遍历操作，以及后缀表达式计算
BiTree
- 二叉树的前序、中序、后序和层次遍历，以及求二叉树的 高度
tree 二叉树
- 设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。
BiTree
- 数据结构中的二叉树的遍历（前序、中序、后序）算法，包括递归和非递归两种实现，另外还实现了层次遍历算法(header文件夹中包含了数据结构的头文件)。-Data structure of binary tree traversal (pre-order, in sequence, after the sequence) algorithm, including recursive and non-recursive two to achieve, in addition to achieving
tree_rebuild
- 给一棵结点编号为1, 2, …, n 的二叉树的前序遍历序列和中序遍历序列，输 出后序遍历序列-To a node numbered 1, 2, ..., n of the binary tree traversal Preorder traversal sequence and in sequence, the output after the traversal sequence
shuju6
- 熟悉二叉树的各种存储结构的特点及适用范围；掌握建立二叉树的存储结构的方法；熟练掌握二叉树的前序、中序、后序遍历的递归及非递归算法；灵活运用递归的遍历算法实现二叉树的其它各种运算-Familiar with the binary tree structure of a variety of storage features and the scope of application acquire storage to establish the structure of binary tree
20071160083341
- 二叉树的遍历，中序，后序，前序。 二叉树的遍历，中序，后序，前序。-Binary tree traversal, in order, post order, the former order. Binary tree traversal, in order, post order, the former order. Binary tree traversal, in order, post order, the former order.
shiyan_5
- 关于二叉树的前序遍历，中序遍历，后序遍历，层次遍历的程序-With regard to the first order binary tree traversal, inorder traversal, postorder, level traversal of the program
tree
- MFC对话框类实现对二叉树的中序遍历排序，前序遍历排序，后序遍历排序，请仔细阅读程序后了解程序输入的格式-MFC dialog class in order to realize the binary tree traversal order, preorder traversal order, post order traversal order, please carefully read the procedures to understand the procedure input fo
buidbinarytree
- 已知二叉树的前序，中序，建立二叉树，并输出它的后序遍历的序列-The first known binary sequence, in order to establish a binary tree, and after traversing the output of its sequence
Bitree
- 二叉树的相关操作,建立，前序遍历，中序遍历，后序遍历-Binary tree-related operations, the establishment of preorder traversal, inorder traversal, after traversing
bianli
- 二叉树的遍历，先序建立二叉树结构，包括前序、中序、后序遍历的递归和非递归遍历，求二叉树的深度。-Binary tree traversal, binary tree structure, the establishment of the first order, including the former order, in order, after traversing the recursive and non recursive traversal, find the depth of a
BiaryTree
- 此程序是二叉树的创建和前序中序后序的遍历和二叉树的显示功能等，主要是对数据结构中二叉树编程的理解。-This program is a binary tree in order to create and preorder postorder binary tree traversal and display functions, mainly in the binary tree data structure is programmed to understand.
BiTree
- 二叉树的前序、中序和后序的递归和非递归算法的遍历。-Binary tree traversal
BTree 二叉树的遍历与应用
- 二叉树的建立，前序中序后序遍历，线索化，递归非递归遍历，查找前驱或后继结点，输出，菜单实现。-The establishment of a binary tree, inorder preorder postorder traversal, threaded, non-recursive traversal recursion, find precursor or successor nodes, output, menu implementation.
datastruct_tree
- 本程序是用MFCA实现的二叉树的前序中序后序递归遍历，中序非递归遍历的实现，-binary tree
Binary-Tree
- 本程序实现了对二叉树的前、中、后和层序的遍历-The program realization of the binary tree before, during, and after the traversal sequence
二叉树
- 二叉树的前序遍历，中序遍历以及后序遍历。(traversal of binary tree)
Bitree
- 已知二叉树的前序和中序，建立标准二叉树，后序遍历输出。(The standard two forked tree is established in the preorder and the output is traversed in the rear order.)