leetcode:Construct Binary Tree from Preorder and Inorder Traversal

最新推荐文章于 2020-12-17 22:54:02 发布

SCAU啊源

最新推荐文章于 2020-12-17 22:54:02 发布

阅读量443

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/chanrenyuan/article/details/39459151

版权

leetcode 专栏收录该内容

168 篇文章 0 订阅

订阅专栏

简单的递归题目,给出中序遍历和前序遍历,重建该树

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    static HashMap<Integer, Integer> mp;
    public TreeNode buildTree(int[] preorder, int[] inorder){
        mp = new HashMap<>();
        for(int i = 0; i < inorder.length; ++i){
            mp.put(inorder[i], i);
        }
        return buildTree(inorder, 0, inorder.length , preorder, 0, preorder.length );
    }

    public TreeNode buildTree(int[] inOrder, int inStart, int inEnd,
                                        int[] preOrder, int preStart, int preEnd){

        TreeNode node = null;
        if(inStart < inEnd){
            node = new TreeNode(preOrder[preStart]);
            int site = mp.get(preOrder[preStart]);
            node.left = buildTree(inOrder, inStart, site, preOrder, preStart + 1, preStart + site - inStart);
            node.right = buildTree(inOrder, site + 1, inEnd, preOrder, preStart + site - inStart + 1, preEnd);
        }
        return node;
    }


}