PROGRAMMING:Creation and traversal of binary tree

The binary tree is created by the pre root sequence with null pointer information (also known as the pre order sequence), and traverses the pre root (pre order), middle root (middle order) and post root (post order). The value of the node data field of the binary tree is an integer not equal to 0 (which may be positive or negative), and the null pointer is represented by 0. For example, 158000600 represents the binary tree as shown in the figure below.
###Input format:
The input is a set of integers separated by spaces to represent the first root sequence of binary tree with null pointer information. The null pointer information is represented by 0. The number of nodes of binary tree is not more than 150000, and the height is not more than 6000. The input data ensures that the data values of each node of the binary tree are not equal to each other.
###Output format:
The output is 3 lines of integers with a space after each integer. The first row is the first root sequence of the binary tree, the second row is the middle root sequence, and the third row is the last root sequence.
###Input example:
```in
1 5 8 0 0 0 6 0 0
```
###Output example:
```out
1 5 8 6
8 5 1 6
8 5 6 1
```







answer：If there is no answer, please comment