Search
⌘K
Leetcode 144. Binary Tree Preorder Traversal
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.