2015年2月19日
[LeetCode] 106. Construct Binary Tree from Inorder and Postorder Traversal 由中序和后序遍历建立二叉树
摘要： Given inorder and postorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. For example, 阅读全文
posted @ 2015-02-19 17:29 Grandyang 阅读(14256) 评论(4) 推荐(0) 编辑
Fork me on GitHub