LeetCode Question · May 2020 · Los Angeles

Facebook | Phone | Binary Tree Preorder Iterator

SWE

Sign in to bookmark Original →

5 upvotes 2,216 views 11 replies

Question Details

Implement a preorder iterator for a Binary Tree, need to be O N time and space needs to be less than O(N) or O(1). it needs to have the next and...

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Binary Search Binary Tree

More from Meta

Reddit Leetcode is cooked in 2026 and we don't hire people who only grind leetcode. Reddit Returning to SWE work after 3 years of cancer treatment Reddit 2026 New Grad Recap Reddit Most likely failed meta phone screen Reddit Targeting OpenAI SWE Roles? Insights on what to expect from recent system design loops

← All Meta questions Meta Software Engineer Questions → All Trees Questions →