面试题6. 重建二叉树

题目描述

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

思路：

二叉树的先序遍历中，第一个数字是根节点的值。通过根节点的值，能够将中序遍历划分为左子树和右子树两个部分。然后递归左子树和右子树。

java代码如下：

/**
 * 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.length == 0 || in.length == 0) {
            return null;
        }
        return core(pre, 0, pre.length-1, in, 0, in.length-1);
    }
    
    public TreeNode core(int[] pre, int preStart, int preEnd, int[] in, int inStart, int inEnd) {
        
        if(preStart > preEnd || inStart > inEnd) {
            return null;
        }
        
        TreeNode root = new TreeNode(pre[preStart]);
        
        for(int i = inStart; i <= inEnd; i++) {
            if(in[i] == pre[preStart]) {
                root.left = core(pre, preStart + 1, preStart + i - inStart, in, inStart, i - 1);
                root.right = core(pre, preStart + i -inStart + 1, preEnd, in, i + 1, inEnd);
                break;
            }
        }
        return root;
    }
}

写法2：
    public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
        if (pre.length == 0) {
            return null;
        }
        return reConstruct(pre, 0, pre.length - 1, 
                           in,  0, in.length - 1);
    }
    
    public TreeNode reConstruct(int[] pre, int preStart, int preEnd, 
                                int[] in, int inStart, int inEnd) {
        if (preStart > preEnd || inStart > inEnd) {
            return null;
        }
        TreeNode node = new TreeNode(pre[preStart]);
        int headIndex = getIndex(in, node.val);
        node.left = reConstruct(pre, preStart + 1, preStart + (headIndex - inStart),
                                in, inStart, headIndex - 1);
        node.right = reConstruct(pre, preStart + 1 + (headIndex - inStart), preEnd,
                                in, headIndex + 1, inEnd);
        return node;
    }
    
    public int getIndex(int[] in, int target) {
        for (int i = 0; i < in.length; i++) {
            if (in[i] == target) {
                return i;
            }
        }
        return 0;
    }

注：学渣心里苦，不要学楼主，平时不努力，考试二百五，哭 ~