搜索资源列表
二叉树的遍历.rar
- 数据结构中的平衡二叉树的代码
二叉树操作&图的遍历操作
- 二叉树操作&图的遍历操作, 完全按照里面的文挡用VC所完成的程序, 有详细的说明-binary tree traversal operation of the plan operations, in full accordance with the text inside the block with VC performed by the procedure is described in detail in
二叉树的各种遍历操作(非)递归
- 数据结构的基本应用,二叉树的遍历。适合初学者,比较简单。 -the basic data structure application binary tree traversal. For beginners, relatively simple.
树遍历
- 有关树的遍历问题-the tree traversal issue
ECSBL
- 该程序实现二叉树的遍历功能,能够打印出二叉树的节点-The program realization of the binary tree traversal function, is capable of printing out the binary tree node
Binarytree
- 实现构造一个二叉树、二叉树的遍历(递归与非递归方法)-To achieve construct a binary tree, Binary Tree Traversal (recursive and non-recursive method)
erchashu
- 二叉树的遍历 先序 中序 后序 遍历和层次遍历-Binary tree traversal sequence in the sequence after the first traversal and the traversal level
Bitree
- 实现各种二叉树的遍历。包括先序遍历、中序遍历、后序遍历的递归或递 归算法。-To achieve a variety of binary tree traversal. Including the first traversal, in order traversal, postorder traversal of the recursion or recursive algorithm.
BinaryTree
- 这是用C语言实现的二叉树的遍历算法,包括递归和非递归算法的实现。-This is to use C language implementation of the binary tree traversal algorithms, including recursive and non-recursive algorithm implementation.
datastruct_example
- 本人讲授数据结构课程时的所写的示例程序,结构清晰规范,有注释,全部可编译运行,包括如下代码: 长整数:ch0_bigint2.c 顺序表的实现:ch2_stable.c 链表的实现ch2_ltable.c 合并两个有序表:ch2_stable_merge.c 表达式计算:ch3_express.c 队列的链式实现:ch3_lqueue.c 栈的链式实现:ch3_lstack.c 迷宫求解:ch3_maze.c 队列的顺序实现:ch3_squeue.c
erchashu
- 数据结构二叉树的遍历 例如 输入abc..de.f..g... 输出其先序遍历中序遍历后序遍历-例如 输入abc..de.f..g... 输出其先序遍历中序遍历后序遍历
DataStructureCourseDesignBinaryTreeTraversal
- 一个非常经典的原创的数据结构课程设计--二叉树的遍历-相信大家非常xihuan -A very classical structure of the original curriculum design data- Binary Tree Traversal- I believe we are very xihuan
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.
tree
- 树形结构的逻辑和存储特点。 二叉树的遍历递归算法。 -tree
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
BTree 二叉树的遍历与应用
- 二叉树的建立,前序中序后序遍历,线索化,递归非递归遍历,查找前驱或后继结点,输出,菜单实现。-The establishment of a binary tree, inorder preorder postorder traversal, threaded, non-recursive traversal recursion, find precursor or successor nodes, output, menu implementation.
8606-二叉树的构建及遍历操作
- 实现二叉树的遍历操作,属于数据结构基础算法,代码能够顺利运行,运行环境是ColdBlick。(The traversing operation of two forked tree belongs to the basic algorithm of data structure, the code can run smoothly, and the running environment is ColdBlick.)
二叉树的遍历
- 主要实现:创建二叉树、用先中后序遍历二叉树(中序,先序和后序遍历用非递归实现),并输出树高。(The main achievement is to create two branches tree, and use the first and middle traversal to traverse the two fork tree.)
二叉树的先、中、后序遍历序列
- 从键盘接收扩展先序序列,以二叉链表作为存储结构,建立二叉树。输出这棵二叉树的先序、中序和后序遍历序列。 输入 输入扩展先序序列。二叉树结点的data是字符类型数据, 其中#表示空格字符。 输出 三行依次输出先序、中序、后序遍历序列。 样例输入 ABC##DE#G##F### 样例输出 ABCDEGF CBEGDFA CGEFDBA