LeetCode 105:从前序与中序遍历序列构造二叉树

LeetCode 105:从前序与中序遍历序列构造二叉树

逻辑点：
1、需要根据前序遍历序列找到根节点。
2、接着找到中序遍历序列中找到根节点，根节点左边对应的为左子树，根节点有点对应的为右子树。
3、不断递归，构建出左子树和右子树

代码：

import java.util.HashMap;
import java.util.Map;

public class leetcode_105 {


    class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode() {
        }

        TreeNode(int val) {
            this.val = val;
        }

        TreeNode(int val, TreeNode left, TreeNode right) {
            this.val = val;
            this.left = left;
            this.right = right;
        }
    }

    class Solution {

        private Map<Integer, Integer> inOrderMap;

        private int[] preOrder;

        public TreeNode buildTree(int[] preorder, int[] inorder) {
            //获取前序序列长度
            int preOrderLength = preorder.length;
            //获取中序序列长度
            int inOrderLength = inorder.length;
            //增加判断
            if (preOrderLength != inOrderLength) {
                throw new RuntimeException("not equal");
            }
            //使用hashmap缓存中序序列的值
            this.inOrderMap = new HashMap<>();
            //指定前序遍历序列，方便后面的递归方法找到根节点
            this.preOrder = preorder;
            for (int i = 0; i < inOrderLength; i++) {
                inOrderMap.put(inorder[i], i);
            }
            return buildTree(0,preOrderLength - 1, 0, inOrderLength - 1);
        }

        public TreeNode buildTree(int preLeft, int preRight, int inLeft, int inRight) {
            //递归第一步：找到递归结束条件
            if (preLeft > preRight || inLeft > inRight) {
                return null;
            }
            //找到根节点
            int pivot = preOrder[preLeft];
            //利用找到的根节点开始创建二叉树结点
            TreeNode root = new TreeNode(pivot);
            //找到当前根节点在中序遍历序列中的索引
            int pivotIndex = inOrderMap.get(pivot);
            //递归构建左树
            root.left = buildTree(preLeft + 1, pivotIndex - inLeft + preLeft, inLeft, pivotIndex - 1);
            root.right = buildTree(pivotIndex - inLeft + preLeft + 1, preRight, pivotIndex + 1, inRight);
            return root;
        }
    }
}

参考题解：https://leetcode.cn/problems/construct-binary-tree-from-preorder-and-inorder-traversal/solutions/8946/qian-xu-bian-li-python-dai-ma-java-dai-ma-by-liwei/