已知一颗二叉树的前序遍历和中序遍历,还原该二叉树
例子:
解题思路:首先在前序中找到第一个元素作为整棵树的头节点,再从中序数组中找到头结点的位置,头结点的左边部分作为头结点的左子树,头结点的右边部分作为右子树,所以可以将两个数组拆分为左子树的前序数组和中序数组,右子树的前序数组和中序数组,再以前序数组的第一个元素作为左右子树的头结点的值,递归下去,直到整棵树构建完成。具体代码如下。
public class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
public class Solution {
public TreeNode buildTree(int[] preorder, int[] inorder) {
return spiltArray(preorder, 0, preorder.length - 1, inorder, 0, inorder.length - 1);
}
public TreeNode spiltArray(int[] preorder,int sp,int ep,int[] inorder,int si,int ei){
if (sp>ep)
return null;
TreeNode root=new TreeNode(preorder[sp]);
int sum=0;
for (int i = si; i <= ei; i++) {
if (preorder[sp]!=inorder[i])
sum++;
else break;;
}
root.left=spiltArray(preorder,sp+1,sp+sum,inorder,si,si+sum-1);
root.right=spiltArray(preorder,sp+sum+1,ep,inorder,si+sum+1,ei);
return root;
}
}
题目拓展:给出中序和后序,构建二叉树,因为解题思路和上面是一样的,所以直接上代码
public class Solution {
public TreeNode buildTree(int[] inorder, int[] postorder) {
return spiltArray1(inorder,0,inorder.length-1,postorder,0,postorder.length-1);
}
public static TreeNode spiltArray1(int[] inorder,int is,int ie, int[] postorder,int ps,int pe){
if (is>ie)return null;
TreeNode root=new TreeNode(postorder[pe]);
int sum=0;
for (int i = is; i <=ie ; i++) {
if (inorder[i]!=postorder[pe])
sum++;
else break;
}
root.left=spiltArray1(inorder,is,is+sum-1,postorder,ps,ps+sum-1);
root.right=spiltArray1(inorder,sum+is+1,ie,postorder,ps+sum,pe-1);
return root;
}
}