Find the maximum sum path between any two leaf nodes in a binary tree.
{
"root": [
3,
4,
5,
-10,
4
]
}16{
"root": [
-15,
5,
6,
-8,
1,
3,
9,
2,
6,
null,
null,
0,
4,
-1,
10
]
}32{
"root": [
1,
2,
3
]
}6Sign in to Run Code and Submit