搜索资源列表
blasdfew
- 以先序,中序,后序遍历二叉链表的非递归算法-to be the first sequence, sequence, after the preorder the binary tree of non - recursive algorithm
Binary_tre1762296262004(1)
- 程序用于实现二叉树的建立及先序中序后序的遍历
binarytree
- 数据结构 二叉排序树 先序中序后序遍历 二叉树的查找-Data structure binary sort tree preorder traversal sequence after sequence of binary tree search
erchashu
- 二叉树的遍历 先序 中序 后序 遍历和层次遍历-Binary tree traversal sequence in the sequence after the first traversal and the traversal level
TreeTraverse
- 二叉树的遍历操作，树结构用二叉链表存储，遍历时采用递归先序 中序 后序，层次遍历和非递归先序 中序 后序遍历-Binary tree traversal operations, binary tree structure list with storage, the use of recursive traversal sequence in the sequence after the first sequence, level and non-recursive traversal sequ
BinTree
- 创建二叉树,然后先序,中序,后序遍历二叉树中的各元素.-Create a binary tree, and then the first order, in sequence, after the tree traversal of the element.
hh
- 用递归实现二叉树的先序,中序,后序3种遍历.-Binary tree with recursive realization of the first order, in sequence, the latter three kinds of traversal sequence.
erchashu
- 二叉树 图形演示 创建 先序 中序 后序 查找 删除 -erchashu tuxingyanshi
The_operation_of_the_tree
- 用C++实现了数据结构中树的操作 包括树的构建、先序中序后序遍历、树的拆除、结点的添加与删除、树的深度计算等 程序调试完全通过-Achieved with C++ data structure tree operations include the construction of the tree, the first sequence in the sequencing order traversal, tree removal, node addition and deletion, the
erchashu
- 建立一颗用二叉树链表方式存储的二叉树，斌对其进行表里（先序中序后序），打印输出表里结果。-Create a list using a binary tree stored in the binary tree, its bin table (after the first sequence in the sequence order), print out the result table.
fei-digui-tree
- 利用非递归的方式对一个二叉树进行操作 比如先序中序后序遍历-Use of non-recursive way to operate on a binary tree such as the first post-order traversal sequence in order
digui-binary-tree
- 利用递归的方式对一个二叉树进行操作 比如先序中序后序遍历-Recursive way to operate on a binary tree such as the first post-order traversal sequence in order
erchashushixian
- 通过二叉树的链接表示方法在二叉树类中添加成员函数用于实现二叉树的构建，删除和求二叉树的节点个数的运算，二叉树先序中序后序遍历的运算还有二叉树的复制运算以及求二叉树中叶子节点个数的运算。-Binary color to achieve a link through the binary tree representation in the binary tree class by adding member functions used to implement the construction
shu
- MFC写的二叉树小程序，输入后可以显示树，递归先序中序后序遍历和非递归中序遍历，数据结构相关-MFC binary write small programs can be displayed after the input tree, recursive sequence in the first post-order traversal order and non recursive inorder traversal, the data structure associated
Binary-tree
- 创建二叉树，先序中序后序递归二叉树，求叶子数目，求树高，左右子树交换。-Create a binary tree, in order of first-order recursive post-order binary tree, find the number of leaves, tree height requirements, exchange of left and right subtrees.
Traverse.doc
- 运用栈来实现树的先序中序后序的遍历非递归算法-preorder non- recursive algorithm , inorder non- recursive algorithm , postorder non- recursive algorithm
Nonrecursive
- 二叉树的先序中序后序遍历的非递归函数，都写在一个项目中，仅供大家参考-Binary tree s first order after sequence traverse sequence
shu
- 二叉树的遍历,先序,中序,后序,层序遍历-Binary tree traversal, preorder, inorder, postorder sequence traversal
allBtreebianli
- 集合了数据结构二叉树的基本知识，讲解了二叉树的几种遍历，先序中序后序遍历的递归非递归用法-A collection of basics binary tree data structure, explain several binary tree traversal, after the first sequence in order preorder recursive non-recursive Usage
二叉树的先、中、后序遍历序列
- 从键盘接收扩展先序序列，以二叉链表作为存储结构，建立二叉树。输出这棵二叉树的先序、中序和后序遍历序列。 输入 输入扩展先序序列。二叉树结点的data是字符类型数据, 其中#表示空格字符。 输出 三行依次输出先序、中序、后序遍历序列。 样例输入 ABC##DE#G##F### 样例输出 ABCDEGF CBEGDFA CGEFDBA