#include <bits/stdc++.h>
using namespace std;

const int N = 1e6 + 5;

vector <int> adj[N];
int fa[N], siz[N], ans[N];
int T, n;

void dfs1(int u) {
	siz[u] = 1;
	for (auto v : adj[u]) {
		dfs1(v);
		siz[u] += siz[v];
	}
}

int f[N], MID;
void dfs2(int u) {
	f[u] = 0;
	for (auto v : adj[u]) {
		dfs2(v);
		f[u] += f[v];
	}
	f[u] = max(0, f[u] - MID) + (u != 1);
}

int ok[N];
void dfs3(int u) {
	if (f[u] <= 1) return;
	ok[u] = 1;
	for (auto v : adj[u]) dfs3(v);
}

int main() {
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		for (int i = 1; i <= n; i++) {
			adj[i].clear();
			ok[i] = 0;
		}
		for (int i = 2; i <= n; i++) {
			scanf("%d", &fa[i]);
			adj[fa[i]].push_back(i);
		}
		if (n == 2) {
			printf("10\n");
			continue;
		}
		dfs1(1);
		int l = 1, r = n - 1, res = n - 1;
		while (l <= r) {
			int mid = (l + r) >> 1;
			MID = mid; dfs2(1);
			if (f[1] <= 1) res = mid, r = mid - 1;
			else l = mid + 1;
		}
		MID = res; dfs2(1);
		if (f[1] == 1) {
			for (auto v : adj[1]) dfs3(v);
		} else {
			for (int i = 1; i <= n; i++) ok[i] = 1;
		}
		// fprintf(stderr, "res = %d, f[1] = %d, f[2] = %d\n", res, f[1], f[2]);
		for (int u = 1; u <= n; u++) {
			int ans = 0;
			if (siz[u] - 2 > res) ans = 1;
			else if (siz[u] - 2 == res) ans = ok[u];
			printf("%d", ans);
		}
		printf("\n");
	}
	return 0;
}