Construct Binary Tree from Preorder and Inorder Traversal<leetcode>
摘要:
Given preorder and inorder traversal of a tree, construct the binary tree. Note:You may assume that duplicates do not exist in the tree. 题意:知道二叉树的前序遍历 阅读全文
posted @ 2014-09-29 22:00 菱纱梦 阅读(175) 评论(0) 推荐(0) 编辑