leetcode/problems/binary-tree-preorder-traversal at v1.5.1 · awesee/leetcode

Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
binary_tree_preorder_traversal.go		binary_tree_preorder_traversal.go
binary_tree_preorder_traversal_test.go		binary_tree_preorder_traversal_test.go

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

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

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,2,3]

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