Binary Tree Preorder Traversal

Problem

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].

---

Idea

stack 实现根 左 右。

---

Solution

---