PROGRAMMING:Play with binary list
The program is designed to create the binary list of binary tree in order; Then the binary tree is traversed by preorder, middle order and postorder.
###Input format:
Input a binary tree in order. The key value of each node in the binary tree is represented by characters, and there is no space between the characters. Note that the empty tree information should also be provided, and the # character is used to represent the empty tree.
###Output format:
Output 3 lines. The first line is the sequence of traversing the binary tree in order, the second line is the sequence of traversing the binary tree in order, and the third line is the sequence of traversing the binary tree in order. There must be no extra spaces at the beginning and end of each line. The sequence does not contain #.
###Input example:
```in
ab##dc###
```
###Output example:
```out
abdc
bacd
bcda
```
answer：If there is no answer, please comment
###Input format:
Input a binary tree in order. The key value of each node in the binary tree is represented by characters, and there is no space between the characters. Note that the empty tree information should also be provided, and the # character is used to represent the empty tree.
###Output format:
Output 3 lines. The first line is the sequence of traversing the binary tree in order, the second line is the sequence of traversing the binary tree in order, and the third line is the sequence of traversing the binary tree in order. There must be no extra spaces at the beginning and end of each line. The sequence does not contain #.
###Input example:
```in
ab##dc###
```
###Output example:
```out
abdc
bacd
bcda
```
answer：If there is no answer, please comment