← Amazon questions
CodingEasy

Find inorder predecessor and successor in BST with parent pointers

Filed under Amazon

Given a node in a Binary Search Tree (BST) that includes left, right, and parent pointers, find its inorder predecessor and 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.