LeetCode-Binary Tree Postorder Traversal
摘要：
1 Given a binary tree, return the postorder traversal of its nodes' values. 2 3 For example: 4 Given binary tree {1,#,2,3}, 5 1 6 \ 7 2 ... 阅读全文
posted @ 2015-03-16 10:53 IncredibleThings 阅读(133) 评论(0) 推荐(0) 编辑