/*

_/      _/       _/_/_/      _/      _/    _/           _/_/_/_/_/
 _/    _/      _/      _/     _/    _/     _/           _/
  _/  _/      _/               _/  _/      _/           _/
   _/_/       _/                 _/        _/           _/_/_/_/
  _/  _/      _/                 _/        _/           _/
 _/    _/      _/      _/        _/        _/           _/
_/      _/       _/_/_/          _/        _/_/_/_/_/   _/_/_/_/_/

*/
#include <bits/stdc++.h>
#define ll long long
#define lc(x) ((x) << 1)
#define rc(x) ((x) << 1 | 1)
#define ru(i, l, r) for (int i = (l); i <= (r); i++)
#define rd(i, r, l) for (int i = (r); i >= (l); i--)
#define mid ((l + r) >> 1)
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second
#define sz(s) (int)s.size()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
using namespace std;
#define maxn 1000005
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());
int read() {
    int x = 0, w = 0; char ch = getchar();
    while(!isdigit(ch)) w |= ch == '-', ch = getchar();
    while(isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
    return w ? -x : x;
}
int n, fa[maxn], son[maxn], siz[maxn], f[maxn], vis[maxn];
int chk(int x) {
    ru(i, 1, n) f[i] = son[i] - x;
    rd(i, n, 1) f[fa[i]] += max(0, f[i]);
    return f[1] > 0;
}
void solve() {
    n = read();
    ru(i, 1, n) son[i] = siz[i] = 0;
    ru(i, 2, n) son[fa[i] = read()]++;
    int l = 0, r = n;
    while(l < r) {
        if(chk(mid)) l = mid + 1;
        else r = mid; 
    }
    rd(i, n, 1) {
        siz[i] += son[i];
        siz[fa[i]] += siz[i];
    }
    vis[1] = 1;
    ru(i, 2, n) vis[i] = (vis[fa[i]] && f[i] > 0);
    ru(i, 1, n) printf("%d", siz[i] > l || (siz[i] == l && vis[i] && f[1] == 1)); printf("\n");
}
int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int T = read();
    while(T--) solve();
    return 0;
}