Available question text
Given a node in a binary search tree where each node has left, right, and parent pointers (and you may not have the root), find the node that appears immediately after it in an in-order traversal. Key insight: the successor is either the leftmost node in its right subtree or the first ancestor for which the node lies in its left subtree.
Related questions
Continue with questions that share topics or the same question type.
- Inorder Successor in BST
Coding
- Binary Tree Inorder Traversal
Coding · Binary Tree · Depth-First Search · Stack
- Construct Binary Tree from Inorder and Postorder Traversal
Coding
- Construct Binary Tree from Preorder and Inorder Traversal
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 510. Inorder Successor in BST II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source