PROGRAMMING:Binary tree path sum
Write a program to find out the maximum path in the binary tree. The node of the binary tree is an integer that is not equal to 0. The "path" of this problem is limited to the path starting from the root node and ending at the leaf node. The sum of the paths is the sum of the data values of all the nodes contained in the path.
###Input format:
The input is a group of integers separated by spaces, the number of which is not more than 100, indicating the first root sequence of binary tree with null pointer information.
###Output format:
The output is two lines. The first line is the maximum value of the path sum of the binary tree, the second line is a group of integers, with a space after each integer, that is, the node value contained in the maximum path (in the order of leaves from the root). If there are multiple paths meeting the condition, the leftmost path will be output.
###Input sample 1:
```in
1 2 0 0 3 0 0
```
###Output sample 1:
```out
four
1 3
```
###Input sample 2:
```in
-1 2 0 0 3 0 0
```
###Output sample 2:
```out
two
-1 3
```
answer：If there is no answer, please comment
###Input format:
The input is a group of integers separated by spaces, the number of which is not more than 100, indicating the first root sequence of binary tree with null pointer information.
###Output format:
The output is two lines. The first line is the maximum value of the path sum of the binary tree, the second line is a group of integers, with a space after each integer, that is, the node value contained in the maximum path (in the order of leaves from the root). If there are multiple paths meeting the condition, the leftmost path will be output.
###Input sample 1:
```in
1 2 0 0 3 0 0
```
###Output sample 1:
```out
four
1 3
```
###Input sample 2:
```in
-1 2 0 0 3 0 0
```
###Output sample 2:
```out
two
-1 3
```
answer：If there is no answer, please comment