Leetcode: Post order binary tree traversal iteratively

May 28, 2015

Problem statement:

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

For example: Given binary tree {1,#,2,3},

1

\

2

/

3

return [3,2,1].

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

May 27, 2015

这道题看了题解, 才知道问题解决很有难度; 我还没有想过, 估计想也想不清楚; 现在还是第一次接触这题目, 所以, 先阅读, 花半个小时.

http://codeganker.blogspot.ca/2014/03/binary-tree-postorder-traversal-leetcode.html

http://blog.sina.com.cn/s/blog_eb52001d0102v1si.html

认真看看EMC软件工程师的代码, 学习做事的认真的态度.

https://github.com/yuzhangcmu/LeetCode/blob/master/tree/TreeDemo.java

有机会, 我用C#把代码写一遍, 提高自己的编程能力.

http://blog.csdn.net/fightforyourdream/article/details/16843303

https://github.com/yuzhangcmu/LeetCode

求平方根:

http://www.cnblogs.com/yuzhangcmu/p/4199673.html

LeetCode / LintCode 答案查询

http://www.jiuzhang.com/solutions/?source=githubyz

http://www.weibo.com/3948019741/profile?topnav=1&wvr=6

July 7 2015

Share C# code:

https://github.com/jianminchen/leetcode-tree/blob/master/TreePostOrderIterative.cs