题目:输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
思路:用递归的思想。
java代码:
package com.yiibai.helloworld; public class Solution { public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public TreeNode reConstructBinaryTree(int [] pre,int [] in) { TreeNode root=reConstructBTree(pre,0,pre.length-1,in,0,in.length-1); return root; } private TreeNode reConstructBTree(int [] pre,int startPre,int endPre,int [] in,int startIn,int endIn) { if(startPre>endPre||startIn>endIn) return null; TreeNode root=new TreeNode(pre[startPre]); for(int i=startIn;i<=endIn;i++) if(in[i]==pre[startPre]){ root.left=reConstructBTree(pre,startPre+1,startPre+i-startIn,in,startIn,i-1); root.right=reConstructBTree(pre,i-startIn+startPre+1,endPre,in,i+1,endIn); } return root; } }
python代码:
-*- coding:utf-8 -*- class TreeNode: def __init__(self, x): self.val = x self.left = None self.right = None class Solution: # 返回构造的TreeNode根节点 def reConstructBinaryTree(self, pre, tin): # write code here if not pre or not tin: return root=TreeNode(pre[0]) i=tin.index(root.val) root.left=self.reConstructBinaryTree(pre[1:i+1],tin[:i]) root.right=self.reConstructBinaryTree(pre[i+1:],tin[i+1:]) return root