【练习笔记】剑指offer-面试题6 ：重建二义树

【问题】

输入某二叉树的前序遍历和中序遍历的结果，请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6}，则重建二叉树并输出它的后序遍历序列。

【答案】

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
        if(pre == null || pre.length == 0){
            return null;
        }
        if(in == null || in.length == 0){
            return null;
        }
        return recon(0, pre.length-1, 0, in.length-1, pre,in);
        
    }
    
    public TreeNode recon(int pstart,int pend,int istart,int iend,int[] pre, int[] in){
        TreeNode root = new TreeNode(pre[pstart]);
        if(pstart==pend && istart == iend){
            return root;
        }
        int mid = 0;
        for(int i=istart;i<=iend;i++){
            if(in[i]==pre[pstart]){
                mid = i;
                if(mid-istart>0)
                root.left = recon(pstart+1,pstart+mid-istart,istart,mid-1,pre,in);
                if(iend-mid>0)
                root.right = recon(pstart+mid-istart+1,pend,mid+1,iend,pre,in);
            }
        }
        return root;
    }
}