Given a binary tree root
, the task is to return the maximum sum of all keys of any sub-tree which is also a Binary Search Tree (BST).
Assume a BST is defined as follows:
- The left subtree of a node contains only nodes with keys less than the node's key.
- The right subtree of a node contains only nodes with keys greater than the node's key.
- Both the left and right subtrees must also be binary search trees.
Example 1:
Input: root = [1,4,3,2,4,2,5,null,null,null,null,null,null,4,6]
Output: 20
Explanation: Maximum sum in a valid Binary search tree is obtained in root node with key equal to 3.
Example 2:
Input: root = [4,3,null,1,2]
Output: 2
Explanation: Maximum sum in a valid Binary search tree is obtained in a single root node with key equal to 2.
Example 3:
Input: root = [-4,-2,-5]
Output: 0
Explanation: All values are negatives. Return an empty BST.
Example 4:
Input: root = [2,1,3]
Output: 6
Example 5:
Input: root = [5,4,8,3,null,6,3]
Output: 7
Constraints:
- Each tree has at most
40000
nodes.. - Each node's value is between
[-4 * 10^4 , 4 * 10^4]
.# Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution(object): def maxSumBST(self, root): """ :type root: TreeNode :rtype: int """ res = [0] def helper(r): if not r: return 1,None,None,0 fl,minl,maxl,resl = helper(r.left) fr,minr,maxr,resr = helper(r.right) if fl and fr and (maxl is None or maxl<r.val) and (minr is None or minr>r.val): ret = r.val+resl+resr res[0] = max(res[0], ret) return 1, r.val if minl is None else minl, r.val if maxr is None else maxr, ret return 0,None,None,0 helper(root) return res[0]