AlgoMaster Logo

Binary Tree Maximum Path Sum

tree=[-10, 9, 20, null, null, 15, 7]
0 / 37
-10920157maxSum?a path bends at one node and uses at most two arms
algomaster.io
Step:Start: the max path can bend at any node and use any two of its arms