[LeetCode 144] Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values.

For example: Given binary tree {1,#,2,3},

1
 \
  2
 /
3

return [1,2,3].

Note: Recursive solution is trivial, could you do it iteratively?

Diffculty
Medium

Similar Problems
[LeetCode ] Binary Tree Inorder Traversal Medium [LeetCode ] Verify Preorder Sequence in Binary Search Tree Medium

Analysis