Limited Time Offer:Up to 20% off Hello Interview Premium
Up to 20% off Hello Interview Premium 🎉
Hello Interview
Your Dashboard
System Design
Code
Low Level Design
Behavioral
AI Coding
New
ML System Design
Salary Negotiation
Interview Guides
Blog
System Design
Low Level Design
AI Coding
Behavioral
New
Interview Questions
Success Stories
System Design
Low-Level Design
New
Ask The Community
Discord
Mock Interviews
1:1 Mentorship
Refer a Friend
Pricing
Sign in / Sign up
Search
⌘K
Pricing

Tutor

Flatten Nested Tree Iterator

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.

Asked at:

Adobe


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company
​
Level
All Regions
Region

Early June, 2026

Adobe

Senior

Books ├── Fiction │ ├── Harry Potter │ └── Lord of the Rings └── Science Fiction └── Dune Implement an iterator that traverses the hierarchy and implements next(). next() prints the name of root/category/subcategory. iterator.next() # Books iterator.next() # Fiction iterator.next() # Harry Potter iterator.next() # Lord of the Rings iterator.next() # Science Fiction iterator.next() # Dune

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions
System Design Guided Practice
Exclusive content
Learn More
Questions
Meta SWE Interview QuestionsAmazon SWE Interview QuestionsGoogle SWE Interview QuestionsOpenAI SWE Interview QuestionsEngineering Manager (EM) Interview Questions
Learn
Learn System DesignLearn DSALearn BehavioralLearn ML System DesignLearn Low Level DesignGuided Practice
Links
FAQPricingGift PremiumHello Interview Premium
Legal
Terms and ConditionsPrivacy PolicySecurity
Contact
About UsProduct Support

7511 Greenwood Ave North Unit #4238 Seattle WA 98103


© 2026 Optick Labs Inc. All rights reserved.