Available question text
Given a nested tree hierarchy (e.g., categories and subcategories), implement an iterator class with a next() method that traverses and returns each node's value in pre-order (top-down, left-to-right) sequence.
Related questions
Continue with questions that share topics or the same question type.
- Flatten Nested List Iterator
Coding · Depth-First Search · Design · Iterator
- Binary Search Tree Iterator
Coding
- Binary Search Tree Iterator II
Coding
- Flatten a Nested Dictionary
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
Adobe
Flatten Nested Tree Iterator
Reported Jun 1, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source