โ† Amazon questions

Find sum of n elements after kth smallest element in BST

Filed under Amazon

Given a very large Binary Search Tree (BST), find the sum of n elements that appear after the kth smallest element without directly traversing the tree in a standard iterative or recursive manner.

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.