PTA 是否同一棵二叉搜索树 java

参考博客:

https://blog.csdn.net/a1065712890/article/details/79677886

package pat树;
//ac
//参考博客
//https://blog.csdn.net/a1065712890/article/details/79677886
import java.util.Scanner;

public class Main2是否同一棵二叉搜索树 {
    static int n;
    static int m;
    static int[]arr;
    public static boolean charge(node i,node j) {
    	if(i!=null&&j!=null) {
    		if(i.v==j.v)return charge(i.le,j.le)&&charge(i.ri,j.ri);
    		else return false;
    	}
    	else if(i==null&&j==null)return true;
    	else return false;
    }
    public static node insert(node root,int i) {
    	if(root==null) {
    		root=new node();
    		root.v=arr[i];
            return root;
    	}
    	else {
    		if(arr[i]>root.v) {
    			root.ri=insert(root.ri,i);
    		}
    		else {
    			root.le=insert(root.le,