2015年12月14日
[LeetCode]109. 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.解法：这题和由前序序列和中序... 阅读全文
posted @ 2015-12-14 18:43 AprilCheny 阅读(362) 评论(0) 推荐(0) 编辑
[LeetCode]108. Construct Binary Tree from Preorder and Inorder Traversal由前序序列和中序序列重建二叉树
摘要： 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 @ 2015-12-14 18:38 AprilCheny 阅读(528) 评论(0) 推荐(0) 编辑