树查找练习

import java.util.Scanner;

public class 树查找 {

    public static void main(String[] args) {
        Scanner in =new Scanner(System.in);
        while(in.hasNext()){
            int count =in.nextInt();
            int[] num=new int[count];
            for(int i=0;i<count;i++){
                num[i]=in.nextInt();
            }
            int flag=in.nextInt();
            int minAt=0,maxAt=0;
            for(int a=1;a<=flag;a++){
                if(a<flag)
                    minAt+=Math.pow(2, a-1);
                maxAt+=Math.pow(2, a-1);
            }
            if(minAt>count-1)
                System.out.print("EMPTY");
            else if(maxAt>count-1)
                maxAt=count;
            for(int j=minAt;j<maxAt;j++){
                System.out.print(num[j]);
                if(j<maxAt-1)
                    System.out.print(" ");
            }
        }
        in.close();

    }

}