When you purchase through links on our site, we may earn an affiliate commission. Here’s how it works.
Ans - Approch we use DFS using recursive function to solve , first we check left and right if -ve we make whloe side of left and right -ve then we find maxi , adding node.val ,left,right and compare ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results