โ† Amazon questions

BST with subtree scores

Filed under Amazon

Implement a Binary Search Tree where each node holds a score, supporting Update(value, newScore) in O(log n) time and SubTreeScore(value) returning the sum of scores in the subtree in O(1) time.

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.