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.

Filename	Size	Update
二叉查找树(Ⅰ)-创建和遍历.txt	1951	2016-06-28

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．