Available question text
Given a binary tree, find the maximum sum of node values among all subtrees that are valid Binary Search Trees (a subtree is any node with all its descendants). Node values can be negative, so the optimal answer may be 0 (empty BST).
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Maximum Level Sum of a Binary Tree
Coding
- Maximum Sum Leaf to Root Path in Binary Tree
Coding
- Binary Search Tree to Greater Sum Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1373. Maximum Sum BST in Binary Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source