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 / 3retu... 阅读全文
posted @ 2014-08-14 16:40 雨歌_sky 阅读(124) 评论(0) 推荐(0) 编辑
