题目:
先序顺序:根左右
For example: Given a binary tree, return the preorder traversal of its nodes' values. Given binary tree{1,#,2,3},
1 \ 2 / 3
return[1,2,3].
先序顺序:根左右
For example: Given a binary tree, return the preorder traversal of its nodes' values. Given binary tree{1,#,2,3},
1 \ 2 / 3
return[1,2,3].