#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i,a,n) for (int i = a; i < n; i++)
#define repn(i,a,n) for (int i = a; i <= n; i++)
#define per(i,a,n) for (int i = (n) - 1; i >= a; i--)
#define pern(i,a,n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 1100000;
const int M = 1100000;
const int mod = 1e9+7;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

int T, n, sz[N], lim, delta, pp[N], dp[N];
vector<int> g[N];
void dfs(int x) {
	sz[x] = 1;
	int sum = 0;
	for (auto y: g[x]) {
		dfs(y);
		sz[x] += sz[y];
		sum += dp[y];
	}
	dp[x] = max(sum - lim, 0) + 1;
}
void work(int x) {
	if (sz[x] == lim + 1) pp[x] = 1;
	for (auto y: g[x]) {
		if (dp[y] >= 1 + delta) work(y);
	}
}
int main() {
	IO;
	cin >> T;
	while (T--) {
		cin >> n;
		repn(i, 1, n) g[i].clear(), pp[i] = 0;
		repn(i, 2, n) {
			int x;
			cin >> x;
			g[x].pb(i);
		}
		int l = 1, r = n, ans;
		while (l <= r) {
			int mid = (l + r) / 2;
			lim = mid;
			dfs(1);
			if (dp[1] <= lim + 1) r = mid - 1, ans = mid;
			else l = mid + 1;
		}
		repn(i, 1, n) if (sz[i] - 1 > ans) pp[i] = 1;
		lim = ans - 1;
		dfs(1);
		delta = dp[1] - 1 - lim;
		work(1);
		repn(i, 1, n) cout << pp[i];
		cout << "\n";
	}
	return 0;
}