Skip to main content
All Questions

Return the preorder traversal of a rooted tree in which a node can have more than two children.

Unlock detailed company stats for this questionUpgrade

Community answers

No answers contributed by the community yet.

Related questions

Given a tree of objects in which parents and children carry hashes, compute the hashes with a depth-first traversal.

Related courses

Course

Behavioral Interviews: A Practical Guide for Engineers

Get offers at the level you deserve. Prep for senior+ behavioral interviews at FAANG and Tier-1 companies. Made with staff and principal engineers from Meta, Netflix, Google, and more. Avoid downleveling, elevate past projects, and stop sounding like a robot.

Course

Software Engineering Interview Prep

Land your dream software engineering role at Google, Amazon, Microsoft, Meta, Apple, and other top companies. Learn from mock interviews, frameworks, and advice from senior candidates—practice data structures, algorithms, system design, people management, behavioral interviews, and more.