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:
3 / \ 9 20 / \ 15 7
import java.util.LinkedList;
import java.util.Queue;
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) { val = x; }
}
class num105 {
public TreeNode buildTree(int[] preorder, int[] inorder) {
if(preorder.length == 0 || preorder.length != inorder.length) return null;
int[] peek = new int[1];
peek[0] = 0;
return build(peek, 0, inorder.length-1, preorder, inorder);
}
public TreeNode build(int[] peek, int start, int end, int[] preorder, int[] inorder) {
if(start > end) return null;
TreeNode root = new TreeNode(preorder[peek[0]++]);
if(start == end) return root;
int t = start;
while(t <= end && inorder[t] != preorder[peek[0]-1]) t++;
root.left = build(peek, start, t-1, preorder, inorder);
root.right = build(peek, t+1, end, preorder, inorder);
return root;
}
public static void main(String[] args) {
int[] preorder = {1,2};
int[] inorder = {1,2};
num105 solution = new num105();
TreeNode root = solution.buildTree(preorder, inorder);
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
while(!queue.isEmpty()){
TreeNode peek = queue.poll();
if(peek != null){
System.out.println(peek.val);
}else{
System.out.println("null");
}
if(peek != null){
queue.add(peek.left);
queue.add(peek.right);
}
}
}
}
使用前序和中序序列重建二叉树,使用递归的方法,每次获取树的根,但是有一个问题是java不能传值得引用,所以需要借助数组peek来传递引用,peek存放的是当前遍历到的preorder的index,应该是一个可以传递的值,例如顶点peek[0]的值进入递归root.left = build()中后,如果不传指针,则在函数中值发生变化后,但是上层调用函数中root.right = build()的数值不会发生变化。