← Amazon questions

Add greater node values to smaller node values in a binary tree

Filed under Amazon

Modify a Binary Search Tree (BST) such that every node's value is replaced by the sum of all nodes in the tree greater than or equal to the original node's value.

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.