import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
int []array=new int[scanner.nextInt()*2-1];
array[0]=scanner.nextInt();
for(int i=1;i< (array.length+1)/2;i++){
int first=scanner.nextInt();
int second=scanner.nextInt();
boolean firstIn=false;
for (int val : array)firstIn = firstIn?firstIn:first == val;
array[first*2-1]=firstIn?second:array[first*2-1];
array[second*2]=firstIn?array[second*2]:first;
}
for(int i=0;i<(array.length+1)/2;i++) {
if (array[i] == 0) System.out.println("No");
if (array[i] == 0)break;
}
System.out.println("Yes");
}
}
非层序遍历判断二叉树是否是完全二叉树
最新推荐文章于 2024-05-16 20:42:16 发布