剑指04 - 重建二叉树
题目描述
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。
假设输入的前序遍历和中序遍历的结果中都不含重复的数字。
例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。
示例1
输入
[1,2,3,4,5,6,7],[3,2,4,1,6,5,7]
返回值
{1,2,5,3,4,6,7}
解法:
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
return reConstructBinaryTreeBinary(pre, 0, pre.length-1, in, 0, in.length-1);
}
public TreeNode reConstructBinaryTreeBinary(int [] pre, int preStart, int preEnd,
int [] in, int inStart, int inEnd) {
if(preStart > preEnd || inStart > inEnd) return null;
TreeNode root = new TreeNode(pre[preStart]);
// 先确定中序遍历根节点位置后递归,当root.value == in[i]
for(int i=inStart; i<=inEnd; i++){
if(root.val == in[i]) {
root.left = reConstructBinaryTreeBinary(pre, preStart+1, i-inStart+preStart, in,inStart, i-1);
root.right = reConstructBinaryTreeBinary(pre, i+preStart-inStart+1, preEnd, in, i+1, inEnd);
}
}
return root;
}
}
--- 2021.03.26 update --- 记录左子树的长度更好理解 ---
/**
* Definition for binary tree
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
public class Solution {
public TreeNode reConstructBinaryTree(int [] pre,int [] in) {
if(pre == null || in == null || pre.length == 0 || in.length == 0) return null;
if(pre.length == 1) return new TreeNode(pre[0]);
return reConstruct(pre, 0, pre.length-1, in, 0, in.length-1);
}
private TreeNode reConstruct(int [] pre, int preS, int preE, int [] in, int inS, int inE) {
if(preS > preE || inS > inE) return null;
int rootVal = pre[preS];
// 左子树数组长度
int size = 0;
while(in[inS+size] != rootVal) {
size++;
}
TreeNode root = new TreeNode(rootVal);
root.left = reConstruct(pre, preS+1, preS + size, in, inS, inS+size-1);
root.right = reConstruct(pre, preS + size+1, preE, in, inS+size+1, inE);
return root;
}
}
小总结:
1.重建二叉树,直接递归方法,
2.先根据先序遍历结果确定中序遍历根节点所在位置,再用递归方法重建根节点的左右孩子
3.重建左右孩子时,左孩子的先序遍历截止位置为 (preStart-inStart+i),右孩子的先序遍历起始位置是 (preStart-inStart+i+1)
4.这种思路只能先背住了