[LeetCode]145.Binary Tree Postorder Traversal

【題目】 Given a binary tree, return thepostordertraversal of its nodes' values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3 return[3,2,1]. Note: Recursive solution is trivial,

>>阅读原文<<