You've watched the AlgoExpert video on Binary Tree Maximum Path Sum. Twice, even. The postorder helper makes sense, the global update makes sense. You can re-derive the code on a sheet of paper if you

Markdown supported · ⌘↵ to post
No responses yet.