文件名称:baseexp3
介绍说明－－下载内容均来自于网络，请自行研究使用
本实验由以下环节组成：
1） 存储结构
以二叉链表或三叉链表作为二叉树的存储结构；
2） 二叉树的创建(链式存储)
以某一种遍历的次序录入二叉树的元素，写出相应的二/三叉链表的创建算法，并上机实现该算法；
-In this study, composed of the following aspects: 1) The storage structure to two or three-pronged fork linked list is stored as a binary tree structure 2) the creation of a binary tree (chain store) to a particular traversal order of entry binary elements, write the corresponding two/three-pronged list creation algorithm and the algorithm on the machine
1） 存储结构
以二叉链表或三叉链表作为二叉树的存储结构；
2） 二叉树的创建(链式存储)
以某一种遍历的次序录入二叉树的元素，写出相应的二/三叉链表的创建算法，并上机实现该算法；
-In this study, composed of the following aspects: 1) The storage structure to two or three-pronged fork linked list is stored as a binary tree structure 2) the creation of a binary tree (chain store) to a particular traversal order of entry binary elements, write the corresponding two/three-pronged list creation algorithm and the algorithm on the machine
(系统自动生成,下载前可以参看下载内容)
下载文件列表
3-1.cpp
3-4.cpp
3-8(a).cpp
3.cpp
3-4.cpp
3-8(a).cpp
3.cpp