搜索资源列表
二叉树的创建及先序、中序、后序遍历
- 实现数据结构中的二叉树的创建及先序、中序、后序遍历-data structure to create the binary tree and first sequence, sequence, after the preorder
非递归前序,中序,后序遍历二叉树(优化算法)
- 非递归前序,中序,后序遍历二叉树(优化算法)-before non - recursive sequence, sequence after sequence binary tree traversal (optimization algorithm)
树（非二叉树）的建立与后序遍历
- 树（非二叉树）的建立与后序遍历-tree (non-binary tree) and the establishment after preorder
后序遍历的非递归算法
- 二叉树后序遍历的非递归算法-binary tree traversal sequence of non - recursive algorithm
二叉树的前序中序后序遍历MFC
- 我这个主要实现的是创建二叉树，并实现前序中序后序的递归遍历。
非递归前序,中序,后序遍历二叉树(优化算法)
- 非递归前序,中序,后序遍历二叉树(优化算法)-before non- recursive sequence, sequence after sequence binary tree traversal (optimization algorithm)
树（非二叉树）的建立与后序遍历
- 树（非二叉树）的建立与后序遍历-tree (non-binary tree) and the establishment after preorder
后序遍历的非递归算法
- 二叉树后序遍历的非递归算法-binary tree traversal sequence of non- recursive algorithm
二叉树的创建及先序、中序、后序遍历
- 实现数据结构中的二叉树的创建及先序、中序、后序遍历-data structure to create the binary tree and first sequence, sequence, after the preorder
各种二叉树的数据结构
- 按先序扩展序列建立二叉树，先序、中序、后序遍历的递归算法，二叉树遍历的非递归算法，层次的非递归算法，求二叉树的深度。-sequence extended by the first sequence established binary tree, first sequence, sequence, after the preorder the recursive algorithm, the binary tree traversal
binarytreecount
- 给定一棵树的前序\中序,构造出该树,并打印出树的后序 //例如,前序:a b d e h i c g 中序:d b h e i a c g-given a tree before the sequence \ sequence were constructed out of the tree, and print out the following sequence tree// For example, the former se
LastOrderTree
- 创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non- recursive traversal sequence
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.
05
- 实验描述：树的前序遍历和中序遍历结果可以确定一棵树。 输入树的前序遍历结果和中序遍历结果建立起这棵树并给出后序遍历结果。 -Experimental Descr iption: Preorder tree traversal and traversal in order to determine the outcome of a tree. Enter the tree traversal Preorder traversal o
erchashu
- 建立一个二叉树,然后进行前序,中序,后序遍例等功能.-The establishment of a tree, and then proceed to pre-order, in sequence, after the sequence all over the cases of functions.
BiTree
- 二叉树遍历的C语言代码，有前序遍历，中序遍历，后序遍历，比较有参考价值，对于初学者来说很有用！-Binary tree traversal of the C language code, a pre-order traversal, in order traversal, postorder traversal, comparison reference value, useful for beginners!
BST
- 代码实现了二叉树基本操作:实现二叉树的基本操作（包括前序、中序、后序遍历）；从键盘读数，利用前面实现的基本操作，生成一棵二叉查找树；通过遍历二叉树，输出该二叉树的叶节点数；通过遍历二叉树，求二叉树的最大高度；利用队列，按层次输出二叉树各结点。 -Code to achieve the basic operation of the binary tree: binary tree to achieve the basic operat
tree
- 该程序的功能为已知二叉树中序遍历和后序遍历序列，求二叉树的二叉链表结构，程序中假设前序序列和中序序列已经分别储存在数组Pre和In中，由子树的前序和中序序列建立其二叉链表，在中序序列中查找子树根，计算左右子树的大小，置队列为空队列，输出左右孩子并入队列中-The functions of the program in order for the known binary tree traversal and postorder trav
creattree
- 设二叉树结点值为大写字母，输入二叉树的前序遍历和中序遍历序列，生成此二叉树，输出该二叉树的后序遍历和按层次遍历序列。输入某结点值，在二叉树中查找该结点，若该结点存在，则输出从根到该结点的路径，否则给出不存在信息。-Based binary tree node value of capital letters, enter the first order binary tree traversal and traversal sequen
BiTree
- 二叉树的前序、中序、后序和层次遍历，以及求二叉树的 高度-Binary tree of the former order, in sequence, after the traversal sequence and levels, as well as for the height of binary tree