105. Construct Binary Tree from Preorder and Inorder Traversal

最新推荐文章于 2021-05-26 18:38:00 发布

SnailRunFast

最新推荐文章于 2021-05-26 18:38:00 发布

阅读量136

点赞数

分类专栏： Leet Code

本文链接：https://blog.youkuaiyun.com/snailrunfast/article/details/85038923

版权

Leet Code 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种算法，该算法利用给定的先序和中序遍历序列来构建二叉树。通过递归地查找根节点在中序遍历中的位置，可以确定左子树和右子树的元素，从而逐步构建出完整的二叉树结构。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

105. Construct Binary Tree from Preorder and Inorder Traversal

Medium

Given preorder and inorder traversal of a tree, construct the binary tree.

Note:
You may assume that duplicates do not exist in the tree.

For example, given

preorder = [3,9,20,15,7]
inorder = [9,3,15,20,7]

Return the following binary tree:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        if (null == preorder || preorder.length < 1) {
            return null;
        }
        
        int[] idx = {0};
        
        return buildTree(preorder, idx, inorder, 0, inorder.length - 1);
    }
    
    private TreeNode buildTree(int[] preorder, int[] idx, int[] inorder, int s, int e) {
        int rIdx = s;
        for (int i = s; i <= e; i++) {
            if (preorder[idx[0]] == inorder[i]) {
                rIdx = i;
                break;
            }
        }

        TreeNode root = new TreeNode(preorder[idx[0]]);
        if (rIdx - s >= 1) {
            idx[0] += 1;
            root.left = buildTree(preorder, idx, inorder, s, rIdx - 1);
        }
        
        if (e - rIdx >= 1) {
            idx[0] += 1;
            root.right = buildTree(preorder, idx, inorder, rIdx + 1, e);
        }
        
        return root;   
    }
}