摘要: Given a binary tree, return the postorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, return [3,2,1]. Note: Recursive sol 阅读全文
posted @ 2017-05-11 03:24 lettuan 阅读(128) 评论(0) 推荐(0) 编辑