145. Binary Tree Postorder Traversal
摘要:
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]. 解题思路: 方法 阅读全文
posted @ 2016-03-16 21:41 olive_lv 阅读(201) 评论(0) 推荐(0)
浙公网安备 33010602011771号