#include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int MAXN = 1000006;

template <typename T> inline void read(T &WOW) {
    T x = 0, flag = 1;
    char ch = getchar();
    while (!isdigit(ch)) {
        if (ch == '-') flag = -1;
        ch = getchar();
    }
    while (isdigit(ch)) {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    WOW = flag * x;
}

int n, fa[MAXN], siz[MAXN], dp[MAXN], full[MAXN];

bool Check(int mid) {
    for (int i = 1; i <= n; ++i) {
        dp[i] = 0;
    }
    for (int i = n; i >= 1; --i) {
        dp[i] = max(0, dp[i] - mid);
        dp[fa[i]] += dp[i] + 1;
    }
    return (dp[1] == 0);
}

void solve() {
    read(n);
    for (int i = 1; i <= n; ++i) {
        fa[i] = siz[i] = full[i] = 0;
    }
    for (int i = 2; i <= n; ++i) {
        read(fa[i]);
    }
    for (int i = n; i >= 1; --i) {
        siz[fa[i]] += siz[i] + 1;
    }
    int L = 1, R = n - 1, X = 0;
    while (L <= R) {
        int M = (L + R) >> 1;
        if (Check(M)) {
            X = M;
            R = M - 1;
        } else {
            L = M + 1;
        }
    }
    Check(X - 1);
    full[1] = (dp[1] == 1);
    for (int i = 2; i <= n; ++i) {
        full[i] = (full[fa[i]] & (dp[i] > 0));
    }
    for (int i = 1; i <= n; ++i) {
        printf("%d", (siz[i] > X || (siz[i] == X && full[i])) );
    }
    printf("\n");
}

int main() {
    int T; read(T);
    while (T--) {
        solve();
    }
    return 0;
}