126. Binary Tree Maximum Path Sum

PRO

Hard

Topics

Companies

Helpful tools to learn & understand

Watch key transitions, pointers, and variables update step-by-step.

Open

Read clean, documented implementations across multiple patterns.

View Code

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

Input: root = [1,2,3]

Output: 6

Explanation: The optimal path is 2 -> 1 -> 3, which sums to 6.

Input: root = [-10,9,20,null,null,15,7]

Output: 42

Explanation: The optimal path is 15 -> 20 -> 7, which sums to 42.

Time Complexity

O(n)

Space Complexity

O(h)