Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 510. Inorder Successor in BST II
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.