← Flipkart questions

Largest sum BST within a binary tree

Filed under Flipkart

Given a binary tree, find the subtree that is a valid Binary Search Tree (BST) and has the maximum possible sum of its node values. Return the maximum sum.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Flipkart questions

Collected from public candidate posts and coding forums. Updated Nov 2026.