Available question text
Return the preorder (root–left–right) traversal of a binary tree as a list of node values. The recursive solution is trivial; the follow-up asks for an iterative (stack-based) approach.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Inorder Traversal
Coding · Binary Tree · Depth-First Search · Stack
- Closest Binary Search Tree Value II
Coding · Binary Search Tree · Binary Tree · Depth-First Search
- Recover a Tree From Preorder Traversal
Coding · Binary Tree · Depth-First Search · String
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 2 references
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 144. Binary Tree Preorder Traversal
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Meta
Binary Tree Preorder Traversal
Reported date not specified · Source window: 30d
Source snapshot: Oct 20, 2026
Source frequency score: 72.1. This is not an interview probability.
View source