Binary Tree Postorder 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? 这是一道LeetCode中标记为Hard的题.事实上如果没有限…