PAT (Advanced Level) - 1110 Complete Binary Tree

CBT、树BFS

#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;

const int N = 30;

int n;				// [0, n - 1]
int l[N], r[N], last = -1;
bool has_fa[N], is_CBT = true;

void bfs(int u) {
   
   
	int q[N], front