重建二叉树

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

---

---

class Solution
{
    public TreeNode reConstructBinaryTree(int[] pre, int[] tin)
    {
        // write code here
        TreeNode root = reConstructBinaryTree(pre, 0, pre.Length - 1, tin, 0, tin.Length - 1);
        return root;
    }
     public static  TreeNode reConstructBinaryTree(int[] pre, int startPre, int endPre, int[] tin, int startIn, int endIn)
        {
            if (startPre>endPre||startIn>endIn)
            {
                return null;
            }
            //int[] pre = new int[] { 1, 2, 4, 7, 3, 5, 6, 8 };
            //int[] tin =new int[]{4,7,2,1,5,3,8,6};
            //首先进行获取根节点
            TreeNode root = new TreeNode(pre[startPre]);
            for (int i = startIn; i <= endIn; i++)
            {
                //进行获取根节点的索引值
                if (tin[i]==pre[startPre])
                {
                    root.left = reConstructBinaryTree(pre, startPre + 1, startPre + i - startIn, tin, startIn, i - 1);
                    root.right = reConstructBinaryTree(pre, i - startIn + startPre + 1, endPre, tin, i + 1, endIn);
                }
            }
            return root;

        }

}