#include <bits/stdc++.h>

template <class T>
inline int qlog(T a) {
    if (!a) return 0;
	double x = a;
	return ((*(long long*) & x) >> 52 & 2047) - 1023;
}

#define cin Mizuhashi
#define cout Parsee
#define endl '\n'

class Reader{
	private:
	    static const int BUF_SIZE = 1 << 22;
	    char BUF_R[BUF_SIZE], *csy1, *csy2;
	    #ifndef _LOCAL_RUNNING
		    #define GC (csy1 == csy2 && (csy2 = (csy1 = BUF_R) + fread(BUF_R, 1, BUF_SIZE, stdin), csy1 == csy2) ? EOF : *csy1 ++)
		#else
		    char cur;
		    #define GC (cur = getchar())
		#endif
	    #define IL inline
		
    public:
        IL bool eof() {
            #ifndef _LOCAL_RUNNING
                return csy1 == csy2 && (csy2 = (csy1 = BUF_R) + fread(BUF_R, 1, BUF_SIZE, stdin), csy1 == csy2);
            #else
                return cur == EOF;
            #endif
        }
        template <class Ty>
        IL Reader& operator >> (Ty &t) {
            int u = 0;
            char c = GC;
	    	for (t = 0; c < 48 || c > 57; c = GC)
                if (c == EOF) break;
                else if (c == '-') u = 1;
	    	for ( ; c > 47 && c < 58; c = GC) t = (t << 1) + (t << 3) + (c ^ 48);
	    	t = u ? -t : t; return *this;
        }
    	IL Reader& operator >> (double &t) {
            int tmp, u = 0; char c = GC;
	    	for (tmp = 0; c < 48 || c > 57; c = GC)
                if (c == EOF) break;
                else if (c == '-') u = 1;
	    	for ( ; c > 47 && c < 58; c = GC) tmp = (tmp << 1) + (tmp << 3) + (c ^ 48);
	    	t = (tmp = u ? -tmp : tmp);
    	    if (c == '.') {
    	        double x = 1;
    	        for (c = GC; c > 47 && c < 58; c = GC) t += (x /= 10) * (c ^ 48);
    	    }
    	    return *this;
    	}
    	IL Reader& operator >> (char *s) {
			char c = GC;
			for (*s = 0; c < 33; c = GC) if (c == EOF) return *this;
			for ( ; c > 32; c = GC) *s ++ = c;
			*s = 0; return *this;
		}
        IL Reader& operator >> (char &c) {
			for (c = GC; c < 33; c = GC) if (c == EOF) return *this;
            return *this;
        }
}cin;
class Writer{
	private:
	    static const int BUF_SIZE = 1 << 22;
	    char BUF_W[BUF_SIZE], *csy;
	    #define IL inline
		inline void WC(const char c) {
			if (csy - BUF_W == BUF_SIZE) fwrite(BUF_W, 1, BUF_SIZE, stdout), csy = BUF_W;
			*csy ++ = c;
		}
	
	public:
		Writer() : csy(BUF_W) {}
		~ Writer() {fwrite(BUF_W, 1, csy - BUF_W, stdout);}
		IL void flush() {fwrite(BUF_W, 1, csy - BUF_W, stdout); csy = BUF_W;}
		template <class Ty>
		IL Writer& operator << (Ty x) {
		    static int sta[32], top;
			if (x < 0) {
				WC('-');
                do sta[top ++] = - (x % 10); while (x /= 10);
			}else do sta[top ++] = x % 10; while (x /= 10);
			while (top) WC(sta[-- top] ^ 48);
			return *this;
		}
		IL Writer& operator << (const char &c) {WC(c); return *this;}
		IL Writer& operator << (const char *s) {while (*s) WC(*s ++); return *this;}
		IL Writer& operator << (char *s) {while (*s) WC(*s ++); return *this;}
}cout;

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef unsigned int u32;
typedef unsigned long long u64;
typedef vector <int> vi;
typedef vector <ll> vl;

const int MAX_N = 1000000 + 5;
const int INF32 = 0x3f3f3f3f;
const ll INF64 = 1e18;
const int P = 998244353;

int N, fa[MAX_N], son[MAX_N], bro[MAX_N];
int g[MAX_N], h[MAX_N], sz[MAX_N], lim[MAX_N];
vl f[MAX_N];
char ans[MAX_N];

ll query(int u, int x) {
	if (f[u].size() <= x) return 0;
	return f[u][x] - 1ll * g[u] * x + h[u];
}

void dp(int u, int v) {
	if (f[u].size() < f[v].size()) {
		swap(f[u], f[v]);
		swap(g[u], g[v]);
		swap(h[u], h[v]);
	}
	for (int i = 0; i < f[v].size(); i ++) {
		f[u][i] += query(v, i);
	}
	f[v].clear();
}

void dfs(int u) {
	g[u] = 0;
	h[u] = 0;
	sz[u] = 1;
	f[u].clear();
	int cnt = 0;
	for (int v = son[u]; v; v = bro[v]) {
		dfs(v);
		dp(u, v);
		sz[u] += sz[v];
		cnt ++;
	}
	g[u] ++; h[u] += cnt;
	while (!f[u].empty() && query(u, f[u].size() - 1) <= 0) f[u].pop_back();
	for (int i = f[u].size(); i < cnt; i ++) {
		f[u].push_back((g[u] - 1ll) * i + cnt - h[u]);
	}
	lim[u] = f[u].size();
	// fprintf(stderr, "u = %d, lim = %d\n", u, lim[u]);
	// for (int i = 0; i < f[u].size(); i ++) fprintf(stderr, "i = %d, %lld, f = %lld\n", i, f[u][i], query(u, i));
}

void dfs2(int u, int threshold, bool flag) {
	if (lim[u] <= threshold - 1) flag = 0;
	if (sz[u] - 1 > threshold || sz[u] - 1 == threshold && flag) {
		ans[u] = '1';
	}else {
		ans[u] = '0';
	}
	for (int v = son[u]; v; v = bro[v]) dfs2(v, threshold, flag);
}

void solve() {
	cin >> N;
	memset(ans, 0, N + 2);
	memset(son, 0, sizeof(int) * (N + 1));
	for (int i = 2; i <= N; i ++) {
		cin >> fa[i];
		bro[i] = son[fa[i]];
		son[fa[i]] = i;
	}
	dfs(1);
	dfs2(1, lim[1], query(1, lim[1] - 1) == 1);
	cout << ans + 1 << endl;
	// exit(0);
}

int main() {
    int T = 1;
    cin >> T;
    while (T --) solve();
    return 0;
}