[leetcode]Construct Binary Tree from Preorder and Inorder Traversal - java

最新推荐文章于 2025-11-24 01:23:29 发布

最新推荐文章于 2025-11-24 01:23:29 发布 · 128 阅读

文章标签：

#leetcode

leetcode 专栏收录该内容

44 篇文章

订阅专栏

本文详细介绍了如何根据先序和中序集合构建二叉树的过程，通过递归方法找到根节点并构建子树。

根据先序集合找到根，再根据根，在中序集合中找到索引号，采用递归的构建子树的方法

/**

 * Definition for binary tree

 * public class TreeNode {

 *     int val;

 *     TreeNode left;

 *     TreeNode right;

 *     TreeNode(int x) { val = x; }

 * }

 */

public class Solution {

     public TreeNode buildTree(int[] preorder, int[] inorder) {

        return gT(preorder, 0, preorder.length-1, inorder, 0, inorder.length-1);

    }



    private TreeNode gT(int[] preOrder, int pStart, int pEnd, int[] inOrder, int inStart, int inEnd){

        if(preOrder==null || inOrder==null || preOrder.length==0 || inOrder.length==0 || inStart>inEnd || pStart>pEnd){

            return null;

        }

        int childRootVal = preOrder[pStart];

        TreeNode childRoot = new TreeNode(childRootVal);

        int childRootInOrderIndex = -1;

        for(int i=inStart; i<=inEnd; i++){

            if(inOrder[i]==childRootVal){

                childRootInOrderIndex=i;

                break;

            }

        }

        if(childRootInOrderIndex==-1){

            return null;

        }

        int duration = childRootInOrderIndex-inStart;

        childRoot.left=gT(preOrder, pStart+1, pStart+duration, inOrder, inStart, childRootInOrderIndex-1);

        childRoot.right=gT(preOrder, pStart+duration+1,pEnd, inOrder, childRootInOrderIndex+1, inEnd);

        return childRoot;

    }

}