126. Binary Tree Maximum Path Sum

PRO

Hard

Topics

Companies

Hint

Understand Before Coding

Step 1 / 33

Speed: 1.0x

Maximum Path Sum Analysis

Commentary

Initialize global maximum res = -Infinity.

DFS Context

Left Max:-

Right Max:-

Return:-

Global Maximum (res)

-∞

Variables

res-Infinity

Loading visualization...

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: root = [1,2,3]

Output: 6

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

Example 2:

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

Output: 42

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

Constraints:

•
•

Time Complexity

O(n)

Space Complexity

O(h)

126. Binary Tree Maximum Path Sum

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

126. Binary Tree Maximum Path Sum

Understand Before Coding

Maximum Path Sum Analysis

Commentary

DFS Context

Variables

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

Maximum Path Sum Analysis

Commentary

DFS Context

Variables