leetcode - [6]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].思路... 阅读全文
posted @ 2014-09-24 20:51 庄泽波 阅读(147) 评论(0) 推荐(0)
浙公网安备 33010602011771号