2014年10月22日
[Leetcode] 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].No... 阅读全文
posted @ 2014-10-22 13:43 Phoebe815 阅读(170) 评论(0) 推荐(0)
[Leetcode] Binary Tree Preorder Traversal
摘要： Given a binary tree, return thepreordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,2,3].Not... 阅读全文
posted @ 2014-10-22 13:36 Phoebe815 阅读(151) 评论(0) 推荐(0)
[Leetcode] Binary Tree Inorder Traversal
摘要： Given a binary tree, return theinordertraversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[1,3,2].Note... 阅读全文
posted @ 2014-10-22 12:36 Phoebe815 阅读(157) 评论(0) 推荐(0)