PROGRAMMING:Tree and path equal to a certain value
The known tree node is an integer not equal to 0. Given an integer k, please write a program to find the path with the root node as the starting point and the leaf node as the ending point, and the sum of node values is equal to K. if multiple paths meet the conditions, the leftmost path will be output. For example, k = 15, for the tree T shown in Figure 1 (a), the paths satisfying the conditions are 8-5-2, 8-3-4 and 8-7, and the leftmost one should be output as 8-5-2. If there is no path satisfying the condition, it can also be identified.
###Input format:
The input is 2 lines, the first line is a group of integers separated by spaces, the number of which is no more than 100, representing the first root sequence of binary tree with null pointer information. The null pointer information is represented by 0. The second line is the integer K.
Note: we know that the left child of the node in the binary tree corresponds to the left child of the node in the tree, and the right child of the node in the binary tree corresponds to the right brother of the node in the tree. Then we can use the method of "building binary tree based on the first root sequence with null pointer information" to construct the left child right brother storage structure of the corresponding tree. The tree as shown in Fig. 1 (b) corresponds to the tree as shown in Fig. 1 (b).
###Output format:
The output is a line of integers with a space after each integer, that is, the node value contained in the path (in the order from root to leaf). If there are multiple paths satisfying the condition, the leftmost path will be output. If there is no path that meets the condition, output 0, followed by no space.
###Input sample 1:
```in
1 2 0 3 0 4 0 0 0
five
```
###Output sample 1:
```out
1 4
```
###Input sample 2:
```in
1 2 0 0 3 0 0
nine
```
###Output sample 2:
```out
0
```
answer：If there is no answer, please comment
###Input format:
The input is 2 lines, the first line is a group of integers separated by spaces, the number of which is no more than 100, representing the first root sequence of binary tree with null pointer information. The null pointer information is represented by 0. The second line is the integer K.
Note: we know that the left child of the node in the binary tree corresponds to the left child of the node in the tree, and the right child of the node in the binary tree corresponds to the right brother of the node in the tree. Then we can use the method of "building binary tree based on the first root sequence with null pointer information" to construct the left child right brother storage structure of the corresponding tree. The tree as shown in Fig. 1 (b) corresponds to the tree as shown in Fig. 1 (b).
###Output format:
The output is a line of integers with a space after each integer, that is, the node value contained in the path (in the order from root to leaf). If there are multiple paths satisfying the condition, the leftmost path will be output. If there is no path that meets the condition, output 0, followed by no space.
###Input sample 1:
```in
1 2 0 3 0 4 0 0 0
five
```
###Output sample 1:
```out
1 4
```
###Input sample 2:
```in
1 2 0 0 3 0 0
nine
```
###Output sample 2:
```out
0
```
answer：If there is no answer, please comment