Available question text
Given the root of an N-ary tree, produce its preorder traversal (visit each node before its children, left-to-right) as a list of values. Constraints: up to 10^4 nodes and height ≤1000; recursive is trivial, with an iterative stack-based solution as the common follow-up.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Preorder Traversal
Coding · Binary Tree · Depth-First Search · Stack
- Construct Binary Search Tree from Preorder Traversal
Coding
- Construct Binary Tree from Preorder and Inorder Traversal
Coding
- Construct Binary Tree from Preorder and Postorder Traversal
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
No company association
Leetcode 589. N-ary Tree Preorder Traversal
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source