文件名称:erchashudejibencaozuo
介绍说明－－下载内容均来自于网络，请自行研究使用
数据结构二叉树的基本运算。建立一棵二叉树，试编程实现二叉树的如下基本操作：
(1). 按先序序列构造一棵二叉链表表示的二叉树T；
(2). 对这棵二叉树进行遍历：先序、中序、后序以及层次遍历，分别输出结点的遍历序列；
-Binary tree data structure of the basic computing. The establishment of a binary tree, binary tree test programming realize the following basic steps: (1). By the first order binary sequences a list of binary tree express T (2). On the binary tree tree traversal: first order, in sequence, after the traversal sequence as well as the levels, respectively, the output node traversal sequence
(1). 按先序序列构造一棵二叉链表表示的二叉树T；
(2). 对这棵二叉树进行遍历：先序、中序、后序以及层次遍历，分别输出结点的遍历序列；
-Binary tree data structure of the basic computing. The establishment of a binary tree, binary tree test programming realize the following basic steps: (1). By the first order binary sequences a list of binary tree express T (2). On the binary tree tree traversal: first order, in sequence, after the traversal sequence as well as the levels, respectively, the output node traversal sequence
(系统自动生成,下载前可以参看下载内容)
下载文件列表
实验三 二叉树的基本运算.doc