#include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(v) ((int)v.size())
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
#define umap unordered_map
using namespace std;
namespace qiqi {
	void main() {
		int n;
		cin >> n;
		vi fa(n,-1);
		for (int i = 1; i < n; i++) {
			cin >> fa[i]; fa[i]--;
		}
		vi f(n);
		auto chk = [&](int k) {
			f.assign(n,0);
			for (int i = n-1; i > 0; i--) {
				f[fa[i]] += max(f[i]-k,0)+1;
			}
			return f[0] <= k;
		};
		int l = 0,r = n;
		while (r-l > 1) {
			int mid = l+((r-l)>>1);
			chk(mid) ? r = mid : l = mid;
		}
		chk(l);
		vi siz(n,1),can(n);
		for (int i = n-1; i > 0; i--) {
			siz[fa[i]] += siz[i];
		}
		can[0] = f[0] == r;
		for (int i = 1; i < n; i++) {
			can[i] = can[fa[i]]&(f[i] > 0);
		}
		for (int i = 0; i < n; i++) {
			cout << (siz[i]-1 > r || (siz[i]-1 == r && can[i]));
		}
		cout << '\n';
	}
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int T; cin >> T;
	while (T--) qiqi::main();
	return 0;
}