public class completeBinaryTree{
static int n,tree[];
static void inorder(int node){
//传入一个树节点,注意节点从1开始
//左子树节点,递归搜索顺序为2,4,8,16,32......
if(node*2<=n){
inorder(node*2);
}
System.out.print(tree[node]);
System.out.print( );
//右子树节点,递归搜索顺序为3,5,9,17,33......
if(node*2+1<=n){
inorder(node*2+1);
}
}
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
System.out.println("请输入数字");
n=sc.nextInt();
tree=new int[n+1];
for(int i=1;i<=n;i++){
tree[i]=sc.nextInt();
}
inorder(1);
sc.close();
}
}