PROGRAMMING:Searching node and parent node in binary tree
Write a program to find the given node and parent node in the binary tree. Binary tree node data field value is not equal to 0 integer.
###Input format:
Enter a set of integers separated by spaces in line 1 to represent the first root sequence of binary tree with null pointer information, where null pointer 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 queries. In the next M rows, each row has an integer k which is not equal to 0, representing the data value of the node to be searched. M is not more than 100, the number of nodes 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 m lines, 1 integer per line, which represents the data value of the parent node of the node K to be searched. If there is no node K or node K has no parent node in the binary tree, the output is 0.
###Input example:
```in
1 5 8 0 0 0 6 0 0
three
eight
one
six
```
###Output example:
```out
five
0
one
```
answer：If there is no answer, please comment
###Input format:
Enter a set of integers separated by spaces in line 1 to represent the first root sequence of binary tree with null pointer information, where null pointer 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 queries. In the next M rows, each row has an integer k which is not equal to 0, representing the data value of the node to be searched. M is not more than 100, the number of nodes 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 m lines, 1 integer per line, which represents the data value of the parent node of the node K to be searched. If there is no node K or node K has no parent node in the binary tree, the output is 0.
###Input example:
```in
1 5 8 0 0 0 6 0 0
three
eight
one
six
```
###Output example:
```out
five
0
one
```
answer：If there is no answer, please comment