题目
输入某二叉树的前序遍历和中序遍历的结果,请构建该二叉树并返回其根节点。
假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
示例
Input: preorder = [3,9,20,15,7], inorder = [9,3,15,20,7]
Output: [3,9,20,null,null,15,7]
Input: preorder = [-1], inorder = [-1]
Output: [-1]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zhong-jian-er-cha-shu-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
方法1:
Java实现
class Solution {
public TreeNode buildTree(int[] preorder, int[] inorder) {
return build(preorder, 0, preorder.length - 1, inorder, 0, inorder.length - 1);
}
public TreeNode build(int[] preorder, int prestart, int preend, int[] inorder, int instart, int inend) {
if (prestart > preend) return null;
int val = preorder[prestart];
TreeNode root = new TreeNode(val);
int flag = 0;
for (int i = instart; i < inorder.length; i++) {
if (val == inorder[i]) {
flag = i;
break;
}
}
int leftlen = flag - instart;
root.left = build(preorder, prestart + 1, prestart + leftlen, inorder, instart, flag - 1);
root.right = build(preorder, prestart +leftlen + 1, preend, inorder, flag + 1, inend);
return root;
}
}