使用二叉树对一系列整数排序，并进行前序，中序，后序遍历。
可能有多组测试数据，对于每组数据，将题目所给数据建立一个二叉排序树，并对二叉排序树进行前序、中序和后序遍历。每种遍历结果输出一行。每行最后一个数据之后有一个空格。(The binary tree is used to sort a series of integers and traverse them in the order of preceding, middle and post.

There may be multiple sets of test data. For each set of data, a binary sorting tree is established for the data given by the title, and the binary sorting tree is traversed in order of precedence, middle order and post order. Each traversal result outputs one line. There is a space after the last data in each row.)