2015年1月16日
[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 @ 2015-01-16 18:58 andrew-chen 阅读(337) 评论(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 @ 2015-01-16 13:53 andrew-chen 阅读(410) 评论(0) 推荐(0)