7-4 完全二叉树的层序遍历 (25 分)
题面:
代码:
#include <algorithm>
#include <string>
#include <cstring>
#include<stdio.h>
#include<iostream>
#include<cmath>
using namespace std;
int n, a[100];
void solve(int x) {
if (x <= n) {
//cin>>a[x];
solve(2 * x);
solve(2 * x + 1);
cin >> a[x];
} else return;
}
//递归写树!完美的写法!
int main() {
cin >> n;
//solve(0);
solve(1);
for (int i = 1; i <= n; i++) {
if(i!=n)
cout << a[i] << " ";
else cout<<a[i];
}
cout << endl;
return 0;
}