โ† Amazon questions

Find Next Largest Node in BST with Parent Pointer

Filed under Amazon

Given a node in a Binary Search Tree where each node has a parent pointer, find the node with the smallest value greater than the given node's value (in-order successor).

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.