Available question text
Given the root of a binary search tree and a target node p, return p's in-order successor — the node with the smallest key greater than p's key. Leverage BST ordering (e.g., examine p's right subtree or traverse from the root tracking potential successors) to achieve O(h) time.
Related questions
Continue with questions that share topics or the same question type.
- Inorder Successor in BST II
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 285. Inorder Successor in BST
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source