Back to DSA sheet

Binary Tree Maximum Path Sum

HardBinary Trees
Open on LeetCodeAmazonGoogleMeta

Find the maximum sum of any path in a binary tree. A path is a sequence of connected nodes and need not pass through the root.

Constraints
  • 1 <= nodes <= 3 * 10^4
  • -1000 <= Node.val <= 1000
Sheets
Blind 75Grind 75NeetCode 150NeetCode 250
binary-tree-maximum-path-sum.cpp
Loading editor
Custom input (stdin)
Output

Run your code to see its output.