Available question text
Design a bidirectional in-order iterator for a binary search tree that lets you move forward and backward through the sorted elements via next()/hasNext() and prev()/hasPrev(); implement it to support efficient (amortized O(1)) operations using only O(h) extra space (h = tree height) without modifying the tree.
Related questions
Continue with questions that share topics or the same question type.
- Binary Search Tree Iterator
Coding
- Balance a Binary Search Tree
Coding
- Binary Search Tree to Greater Sum Tree
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
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 1586. Binary Search Tree Iterator II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source