2014年11月25日
LeetCode | Construct Binary Tree from Inorder and Postorder Traversal
摘要： Given inorder and postorder traversal of a tree, construct the binary tree. You may assume that duplicates do not exist in the tree. 阅读全文
posted @ 2014-11-25 17:09 Mr.do 阅读(187) 评论(0) 推荐(0)
LeetCode | Construct Binary Tree from Preorder and Inorder Traversal
摘要： Given preorder and inorder traversal of a tree, construct the binary tree. You may assume that duplicates do not exist in the tree. 阅读全文
posted @ 2014-11-25 17:00 Mr.do 阅读(210) 评论(0) 推荐(0)