Problem bank
HardTreesNeetCode 150 · #59/150

Binary Tree Maximum Path Sum

  1. 1
    Learn the pattern

    Pick the traversal first: inorder for BST order, level-order for depth, postorder to bubble info up.

  2. 2
    Trace your version

    Paste your solution into the workspace and watch every step execute.

    Open workspace
  3. 3
    Solve it

    Solve it on LeetCode, then mark it solved here to keep your streak alive.

Construct Binary Tree from Preorder and InorderSerialize and Deserialize Binary Tree