package day0313;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
class TreeNode{
int value;
TreeNode left,right;
}
public class L2_011玩转二叉树 {
static int N;
static int [] zhongxu;
static int [] qianxu;
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
N = scan.nextInt();
zhongxu = new int[N];
qianxu = new int[N];
for (int i = 0; i < zhongxu.length; i++) {
zhongxu[i] = scan.nextInt();
}
for (int i = 0; i < qianxu.length; i++) {
qianxu[i] = scan.nextInt();
}
/*
* 7
1 2 3 4 5 6 7
2 3 1 5 7 6 4
7
1 2 3 4 5 6 7
2 3 1 5 7 6 4
*/
// TreeNode tr = createTree(0, N-1,0, N-1);
TreeNode tr = createTree2(0, N-1,0, N-1);
printTree(tr);
}
public static void printTree(TreeNode node) {
if(node==null)
return;
Queue<TreeNode> queue = new LinkedList<TreeNode>();
boolean falg = true;
queue.add(node);
while(!queue.isEmpty()) {
TreeNode tr = queue.remove();
if(falg) {
System.out.print(tr.value);
falg = false;
}else {
System.out.printf(" %d",tr.value);
}
if(tr.left!=null) {
queue.add(tr.left);
}
if(tr.right!=null) {
queue.add(tr.right);
}
}
}
public static TreeNode createTree(int qi,int qEnd ,int zi,int zEnd) {
if(qi>qEnd || zi>zEnd) {
return null;
}
TreeNode treeNode = new TreeNode();
treeNode.value = qianxu[qi];
for (int i = zi; i <= zEnd; i++) {
if(qianxu[qi] == zhongxu[i]) {
treeNode.left = createTree(qi+1, qi+i-zi, zi, i-1);
treeNode.right = createTree(qi+i-zi+1, qEnd, i+1, zEnd);
break;
}
}
return treeNode;
}
/**
*举一反三,已知中序和后序,求层序遍历
*/
public static TreeNode createTree2(int q,int qEnd,int z,int zEnd) {
if(q>qEnd || z>zEnd) {
return null;
}
TreeNode treeNode = new TreeNode();
treeNode.value = qianxu[qEnd];
for (int i = z; i <=zEnd; i++) {
if(qianxu[qEnd]==zhongxu[i]) {
treeNode.left = createTree2(q, q+i-z-1, z, i-1);
treeNode.right = createTree2(q+i-z, qEnd-1, i+1, zEnd);
break;
}
}
return treeNode;
}
}
L2_011玩转二叉树(Java)
于 2024-04-12 23:54:30 首次发布