文件名称:二叉查找树(Ⅰ)-创建和遍历
介绍说明－－下载内容均来自于网络，请自行研究使用
input
It is composed of multiple sets of data.
Each group of data is composed of two lines. The first line is the number of keywords to be inserted, n (1<=n<=100). The second line is a positive integer separated by a n space, with a value of no more than 100.
output
For each set of data, the output is two lines. The first line is the middle order traversal of the BST, the second line is the rear order traversal of the BST, and the keywords are separated by space.
It is composed of multiple sets of data.
Each group of data is composed of two lines. The first line is the number of keywords to be inserted, n (1<=n<=100). The second line is a positive integer separated by a n space, with a value of no more than 100.
output
For each set of data, the output is two lines. The first line is the middle order traversal of the BST, the second line is the rear order traversal of the BST, and the keywords are separated by space.
相关搜索： tree
(系统自动生成,下载前可以参看下载内容)
下载文件列表
| 文件名 | 大小 | 更新时间 |
|---|---|---|
| 二叉查找树(Ⅰ)-创建和遍历.txt | 1951 | 2016-06-28 |