PROGRAMMING:Delete subtree of binary tree
Write a program to delete the subtree for a given binary tree several times, and output the middle root sequence of the remaining binary tree after deleting the subtree each time. The data field value of binary tree node is an integer not equal to 0. Each delete operation is performed on the remaining binary tree after the last delete operation.
###Input format:
Enter a group of integers separated by spaces in line 1 to represent the first root sequence of binary tree with null pointer information, where null pointer information is represented by 0. For example, 158000 6000 represents the binary tree as shown in the figure below. The second line is integer m, which indicates the number of deletion operations to be performed. Next, m lines, each line has an integer k which is not equal to 0, indicating that the subtree with K as the root is to be deleted. M is not more than 100, and the number of nodes of binary tree is not more than 5000. The input data ensures that the data values of each node are not equal to each other, and the binary tree is not empty after deleting the subtree.
###Output format:
The output is m lines, each line is a group of integers, which represents the middle root sequence of the remaining binary tree after the deletion operation (one space after each integer in the middle root sequence). If the subtree to be deleted is not in the current binary tree, the row outputs 0 (no space after 0).
###Input example:
```in
1 5 8 0 0 0 6 0 0
three
five
eight
six
```
###Output example:
```out
1 6
0
one
```
answer：If there is no answer, please comment
###Input format:
Enter a group of integers separated by spaces in line 1 to represent the first root sequence of binary tree with null pointer information, where null pointer information is represented by 0. For example, 158000 6000 represents the binary tree as shown in the figure below. The second line is integer m, which indicates the number of deletion operations to be performed. Next, m lines, each line has an integer k which is not equal to 0, indicating that the subtree with K as the root is to be deleted. M is not more than 100, and the number of nodes of binary tree is not more than 5000. The input data ensures that the data values of each node are not equal to each other, and the binary tree is not empty after deleting the subtree.
###Output format:
The output is m lines, each line is a group of integers, which represents the middle root sequence of the remaining binary tree after the deletion operation (one space after each integer in the middle root sequence). If the subtree to be deleted is not in the current binary tree, the row outputs 0 (no space after 0).
###Input example:
```in
1 5 8 0 0 0 6 0 0
three
five
eight
six
```
###Output example:
```out
1 6
0
one
```
answer：If there is no answer, please comment