write a c progamme plsss

A binary tree can be uniquely represented in the following way. For example, given the trees

$[1234],[123$##$4],[12345$###$6],$ and$[-123$##$45$####$678$########## $10]$:

$10$

Now you are asked to return the maximum path sum of a binary tree.

Input The first line is an integer $N(2N100),$ the number of test cases. For each test

case, it contains a binary tree, where the total number of node tokens is smaller than

Each token is separated by a space and there is no space after the last token. You

may also assume that each node of the tree is labeled by an integer between $-{10}^4$ and

${10}^4.$

Output The maximum sum of the node values in a root$-$to$-$leaf path.

Sample Input

$3$

$1,2,3,4$

$123$ # # $4$

$12345$ # # # $6$

Sample Output

Explanation Case$1$: it has two paths: $1+2+4$ v$.$s$.1+3.$

Case$2$: it has two paths: $1+2$ v$.$s$.1+3+4.$

Case$3$: it has three paths: $1+2+4+6$ v$.$s$.1+2+5$ v$.$s$.1+3.$