← Amazon questions

Replace BST node with sum of larger elements

Filed under Amazon

Given a Binary Search Tree (BST), modify its node values such that each node's new value is equal to the sum of all original node values in the BST that are strictly greater than that node's original…

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 Amazon questions

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