给定两个整数数组 preorder 和 inorder ,其中 preorder 是二叉树的先序遍历, inorder 是同一棵树的中序遍历,请构造二叉树并返回其根节点。
示例 1:
输入: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
输出: [3,9,20,null,null,15,7]
示例 2:
输入: preorder = [-1], inorder = [-1]
输出: [-1]
提示:
1 <= preorder.length <= 3000
inorder.length == preorder.length
-3000 <= preorder[i], inorder[i] <= 3000
preorder 和 inorder 均 无重复 元素
inorder 均出现在 preorder
preorder 保证 为二叉树的前序遍历序列
inorder 保证 为二叉树的中序遍历序列
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
/**
* Definition for a binary tree node.
* public 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;
* }
* }
*/
public class Solution {
public TreeNode buildTree(int[] preorder, int[] inorder) {
return buildTree2(preorder,0, preorder.length-1, inorder, 0 , inorder.length-1);
}
public TreeNode buildTree2(int[] preorder, int preL, int preR, int[] inorder, int inL, int inR) {
if(preL > preR || inL > inR){
return null;
}
int mid = preorder[preL];
TreeNode root = new TreeNode(mid);
int midIndex = inL;
while(inorder[midIndex] != mid){
midIndex++;
}
root.left = buildTree2(preorder, preL+1, preL+midIndex-inL, inorder, inL, midIndex-1);
root.right = buildTree2(preorder,preL+midIndex-inL+1, preR, inorder, midIndex+1, inR);
return root;
}
}