合肥工业大学数据结构试验三二叉树（包括实验要求、预习报告、最终试验报告）。



主要实验内容：



<1>求二叉树的高度。



<2>设计算法按中序次序输出二叉树中各结点的值及其所对应的层次数。



<3>将按顺序方式存储在数组中的二叉树转换为二叉链表形式。



<4>复制一棵二叉树T到T1。



<5>交换二叉树中每个结点的左右孩子指针的值。



<6>设计算法以实现下面所提到以扩展二叉树的先序序列作为输入构建二叉树的功能。-Hefei University of the data structure to test three binary tree (including experimental requirements, First Report, the final test report). The main experiment: < 1>　Find the height of the binary tree. < 2>　design algorithm in sequence order of the output value of each node in the binary tree and its corresponding number of levels. < 3>　sequentially stored in an array of binary tree binary linked list. < 4>　copy a binary tree T to T1. < 5>　The exchange of the value of the left and right child pointer of each node in the binary tree. < 6>　design algorithm in order to achieve the below mentioned extended binary tree preorder sequence as input to build a binary tree functions.