Available question text
Implement an iterator over a BST that returns elements in in-order (ascending) via next() and hasNext(), starting before the smallest element so the first next() yields the minimum. Aim for next()/hasNext() to handle up to 1e5 calls with amortized O(1) time and O(h) extra space (h = tree height).
Related questions
Continue with questions that share topics or the same question type.
- Binary Search Tree Iterator II
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 · 2 records
Meta
Leetcode 173. Binary Search Tree Iterator
Reported Feb 12, 2026 · 3 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View sourceUber
Leetcode 173. Binary Search Tree Iterator
Reported Apr 26, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source