Description: 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.
To Search:
File list (Check if you may need any files):
合肥工业大学数据结构试验三二叉树
................................\BinTree
................................\BinTree.cpp
................................\BinTree.exe
................................\cbitre.cbt
................................\full41.cbt
................................\实验三.pdf
................................\数据结构实验三预习报告.doc
................................\数据结构试验三最终报告.doc
Download