摘要：
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 @ 2014-11-14 15:30
Mr.do
阅读(102)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, return [1,3,2].Note: Recursive solut 阅读全文
posted @ 2014-11-14 15:22
Mr.do
阅读(105)
评论(0)
推荐(0)
摘要：
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, return [1,2,3]. Note: Recursive sol 阅读全文
posted @ 2014-11-14 15:07
Mr.do
阅读(107)
评论(0)
推荐(0)
浙公网安备 33010602011771号