LeetCode解题报告:Binary Tree Postorder Traversal
摘要：
Given a binary tree, return thepostordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].No... 阅读全文
posted @ 2014-06-16 14:14 BYRHuangQiang 阅读(285) 评论(0) 推荐(0) 编辑
