[LeetCode] Binary Tree Postorder Traversal

given a binary tree, return the postorder traversal of its nodes’ values.

for example:

given binary tree {1,#,2,3},

return [3,2,1].

note: recursive solution is trivial, could you do it iteratively?