Largest Binary Search Subtree in Value - Amazon Top Interview Questions
Problem Statement :
Given a binary tree root, return the largest sum of a subtree that is also a binary search tree. Constraints 0 ≤ n ≤ 100,000 where n is the number of nodes in root Example 1 Input root = [1, [5, [6, null, null], [7, null, null]], [3, [2, null, null], [4, null, null]]] Output 9 Explanation The binary search tree rooted at 3 has the largest sum with 3 + 2 + 4 = 9
Solution :
Solution in C++ :
pair<pair<bool, int>, pair<int, int>> helper(Tree* root, int& res) {
if (!root) {
return {{1, 0}, {INT_MAX, INT_MIN}};
}
pair<pair<bool, int>, pair<int, int>> leftans = helper(root->left, res);
pair<pair<bool, int>, pair<int, int>> rightans = helper(root->right, res);
pair<pair<bool, int>, pair<int, int>> ans;
ans.first.first = leftans.first.first && rightans.first.first &&
root->val > leftans.second.second && root->val < rightans.second.first;
ans.first.second = leftans.first.second + rightans.first.second + root->val;
ans.second.first = min({root->val, leftans.second.first, rightans.second.first});
ans.second.second = max({root->val, leftans.second.second, rightans.second.second});
if (ans.first.first) {
res = max(res, ans.first.second);
}
return ans;
}
int solve(Tree* root) {
int res = 0;
helper(root, res);
return res;
}
Solution in Java :
import java.util.*;
/**
* public class Tree {
* int val;
* Tree left;
* Tree right;
* }
*/
class Solution {
private int maxSubtreeSum = 0;
static class Node {
int sum;
int min;
int max;
boolean isBST;
public Node(int sum, int min, int max, boolean isBST) {
this.sum = sum;
this.min = min;
this.max = max;
this.isBST = isBST;
}
}
public int solve(Tree root) {
dfs(root);
return maxSubtreeSum;
}
private Node dfs(Tree node) {
if (node.left == null && node.right == null) {
maxSubtreeSum = Math.max(maxSubtreeSum, node.val);
return new Node(node.val, node.val, node.val, true);
}
int nodeVal = node.val;
boolean isBST = true;
int sum, minval, maxval;
sum = nodeVal;
minval = nodeVal;
maxval = nodeVal;
if (node.left != null) {
Node lnode = dfs(node.left);
isBST = (isBST && lnode.isBST && (nodeVal > lnode.max));
sum += lnode.sum;
minval = Math.min(minval, lnode.min);
// maxval = Math.max(maxval, lnode.max);
}
if (node.right != null) {
Node rnode = dfs(node.right);
isBST = (isBST && rnode.isBST && nodeVal < rnode.min);
sum += rnode.sum;
maxval = Math.max(maxval, rnode.max);
// minval = Math.min(minval, rnode.min);
}
if (isBST) {
maxSubtreeSum = Math.max(maxSubtreeSum, sum);
return new Node(sum, minval, maxval, true);
}
return new Node(sum, minval, maxval, false);
}
}
Solution in Python :
class Solution:
def solve(self, root):
ans = 0
def go(root):
nonlocal ans
if not root:
return (0, 1e9, -1e9, 1)
ls, lmin, lmax, isl = go(root.left)
rs, rmin, rmax, isr = go(root.right)
if not isl or not isr or (root.val <= lmax) or (root.val >= rmin):
return (0, 0, 0, 0)
ans = max(ans, root.val + ls + rs)
return (root.val + ls + rs, min(root.val, lmin), max(root.val, rmax), 1)
go(root)
return ans
View More Similar Problems
Merge two sorted linked lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C
View Solution →Get Node Value
This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t
View Solution →Delete duplicate-value nodes from a sorted linked list
This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -
View Solution →Cycle Detection
A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example head refers 1 -> 2 -> 3 -> NUL The numbers shown are the node numbers, not their data values. There is no cycle in this list so return 0. head refer
View Solution →Find Merge Point of Two Lists
This challenge is part of a tutorial track by MyCodeSchool Given pointers to the head nodes of 2 linked lists that merge together at some point, find the node where the two lists merge. The merge point is where both lists point to the same node, i.e. they reference the same memory location. It is guaranteed that the two head nodes will be different, and neither will be NULL. If the lists share
View Solution →Inserting a Node Into a Sorted Doubly Linked List
Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function
View Solution →