Given a binary tree, return the

*postorder*traversal of its nodes' values.
For example:

Given binary tree

Given binary tree

`{1,#,2,3}`

,1 \ 2 / 3

return

`[3,2,1]`

.**Note:**Recursive solution is trivial, could you do it iteratively?

Solution;

For iterative solution, we know postal order is visit children before parent so a stack could be apply here as a helper structure. Then, we can ' push left child from root until left most leaf into stack. then start pop node from the stack, however, if the current node which going to be pop out has right node we should start push all left nodes of the right child until to leaf. But the trick point is how to tell if the mid need to be pop out , We can use a child node to catch every popped out node, then if the mid's right node equal to child node which mean this mid's right node has been visited, it is a good time to pop out the mid one .