PTA 玩转二叉树 java

PTA 玩转二叉树题目：https://pintia.cn/problem-sets/1120858298571182080/problems/1120858493795061760

与 PTA 树的遍历题目https://pintia.cn/problem-sets/1120858298571182080/problems/1120858728923549696

解法几乎完全一致，核心是建树过程，请参看PTA 树的遍历题解：

https://blog.csdn.net/aiwo1376301646/article/details/93496863

 

package pat树;
//ac
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main8玩转二叉树 {
    static int n;
    static int[]id;
    static int[]pr;
    static Queue<node>q=new LinkedList<node>();
    
    public static node build(int prl,int prr,int il,int ir) {