README ¶ 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? 解题思路 见程序注释 Expand ▾ Collapse ▴ Documentation ¶ Index ¶ type TreeNode Constants ¶ This section is empty. Variables ¶ This section is empty. Functions ¶ This section is empty. Types ¶ type TreeNode ¶ type TreeNode = kit.TreeNode Source Files ¶ View all Source files binary-tree-preorder-traversal.go Click to show internal directories. Click to hide internal directories.