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].
[leetcode]Binary Tree Preorder Traversal
原文：http://www.cnblogs.com/bittorrent/p/4734330.html