Leetcode 1373. Maximum Sum BST in Binary Tree

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1373. Maximum Sum BST in Binary Tree

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact