搜索资源列表
BinaryTreeoperation
- 二叉树的前序中序后序遍历操作，以及后缀表达式计算
二叉树的前序中序后序遍历MFC
- 我这个主要实现的是创建二叉树，并实现前序中序后序的递归遍历。
BiTree分割视图版
- 将视图分割成两部分，左边为显示取，右边为数据录入区，每录入一个节点数据，立即在左边显示节点图形，能实现二叉树的插入、删除、前序遍历、中序遍历、后序遍历。-View will be divided into two parts, shown from left to right for the data entry areas, each node a data entry immediately on the left shows no
yyh
- 对二叉树的生存,二叉树遍历等,有前序的,中序的,后序的,层次的,求结点数的等.-The survival of the binary tree, binary tree traversal and so on, have pre-ordered, in sequence, after the sequence, level, and of such nodes.
tree
- 该程序的功能为已知二叉树中序遍历和后序遍历序列，求二叉树的二叉链表结构，程序中假设前序序列和中序序列已经分别储存在数组Pre和In中，由子树的前序和中序序列建立其二叉链表，在中序序列中查找子树根，计算左右子树的大小，置队列为空队列，输出左右孩子并入队列中-The functions of the program in order for the known binary tree traversal and postorder trav
BinaryTreeoperation
- 二叉树的前序中序后序遍历操作，以及后缀表达式计算-Binary Tree Preorder traversal sequence after sequence of operations, as well as the suffix expressions calculated
BinTreeExp
- 二叉树的创建、前序递归遍历、中序递归遍历、后序递归遍历、层次遍历、前序非递归遍历、中序非递归遍历、后序非递归遍历算法。里面包含了顺序栈和队列的实现代码。-Binary tree creation, pre-order recursive traversal, recursive in order traversal, postorder recursive traversal, traverse the level, pre-order
BiTree
- 数据结构中的二叉树的遍历（前序、中序、后序）算法，包括递归和非递归两种实现，另外还实现了层次遍历算法(header文件夹中包含了数据结构的头文件)。-Data structure of binary tree traversal (pre-order, in sequence, after the sequence) algorithm, including recursive and non-recursive two to achi
LevelVisit
- 我们了解二叉树的前序,中序和后序遍历,那么设计一个程序实线二叉树的层次遍历-We understand that the first order binary tree, in sequence and post-order traversal, then design a program of line-level binary tree traversal
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 orde
binarytreedepth
- 求二叉树的深度、前中后序遍历的非递归算法-Seeking depth of binary tree, before, during and after traversing a non-recursive algorithm
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 t
ThreeOrder
- 本代码用于求二叉树的前、中、后序遍历序列，可以自定义二叉树的保存形式，比较方便快捷。-Find before, during and after the traversal sequence of the binary tree
datastruct_tree
- 本程序是用MFCA实现的二叉树的前序中序后序递归遍历，中序非递归遍历的实现，-binary tree
java
- java编写二叉树，以及实现了二叉树的前序中序后序遍历(Achieve two binary tree preorder, in order, after traversal)
二叉树遍历
- 简单的二叉树遍历，中序遍历，后序遍历，前序遍历(Simple two tree traversal)
二叉树
- 二叉树的前序遍历，中序遍历以及后序遍历。(traversal of binary tree)
Tree
- 创建二叉树，前序中序后序遍历二叉树，计算叶子结点树以及树的深度。(The two forked tree is created, and the two forked tree is traversed in the preorder of the preorder, and the leaf node tree and the depth of the tree are calculated.)
tranfer
- 二叉树的各类历遍算法的转换，包括前序，中序与后序。(binary tree transfer for students majoring in instruments.)
二叉树中+后 求先
- 首先理解概念： 前序遍历：访问根结点的操作发生在遍历其左右子树之前。 中序遍历：访问根结点的操作发生在遍历其左右子树之中(间)。 后序遍历：访问根结点的操作发生在遍历其左右子树之后。 eg：后序遍历为DBCEFGHA，中序遍历为EDCBAHFG，求前序遍历（网上例子） 解：首先 看后序遍历DBCEFGHA，A为总根节点 然后 寻找中序遍历EDCBAHFG中A位置，则EDCB在A的左枝，HFG在A的右枝； 重复前两步，从后