Find the maximum path sum in a binary tree where the path can start and end at any node.
{
"root": [
1,
2,
3
]
}6{
"root": [
-10,
9,
20,
null,
null,
15,
7
]
}42{
"root": [
2,
-1
]
}2Sign in to Run Code and Submit