Given a binary tree, return the preorder traversal of its nodes' values.
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].

rezaur86/Coding-competitions,rezaur86/Coding-competitions