#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define MOD 1000000007
#define HASH_MOD1 998244353
#define HASH_MOD2 1000000009
#define HASH 31
#define ll long long
#define int long long

typedef __gnu_pbds::tree<int, __gnu_pbds::null_type, less<int>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update> ordered_set;

template <typename T>
istream& operator>> (istream& in, vector<T>& a)
{
    for (int i = 0; i < a.size(); ++i)
        in >> a[i];

    return in;
}

template <typename T>
ostream& operator<< (ostream& out, vector<T>& a)
{
    for (int i = 0; i < a.size(); ++i)
        out << a[i] << " ";

    out << "\n";

    return out;
}

template <typename T>
ostream& operator<< (ostream& out, set<T>& s)
{
    for (int x : s)
        out << x << " ";

    out << "\n";

    return out;
}

template <typename T>
ostream& operator<< (ostream& out, vector<pair<T, T>>& v)
{
    for (int i = 0; i < v.size(); ++i)
        out << v[i].first << " " << v[i].second << "\n";

    return out;
}

ll modinv(ll a)
{
    return a <= 1 ? a : MOD - (MOD / a) * modinv(MOD % a) % MOD; 
}

ll binpow(ll x, ll y)
{
    ll ans = 1;

    while (y > 0)
    {
        if (y % 2 == 1)
            ans *= x;

        x = x * x;
        y = y / 2;

        x %= MOD;
        ans %= MOD;
    }

    return ans;
}

void init(vector<vector<int>>& children, vector<int>& size, int u)
{
    size[u] = 1;

    for (int v : children[u])
    {
        init(children, size, v);
        size[u] += size[v];
    }
}

int dfs(vector<vector<int>>& children, vector<int>& got, vector<bool>& passed, int u, int z)
{
    int res = 0;
    got[u] = 0;
    passed[u] = false;

    for (int v : children[u])
        res += dfs(children, got, passed, v, z);

    got[u] = res;

    if (got[u] > z)
    {
        res = got[u] - z;
        passed[u] = true;
    }

    else
    {
        res = 0;
        passed[u] = false;
    }

    return res + (u != 0);
}

void solve()
{
    int n, i;
    cin >> n;

    vector<vector<int>> children(n);
    vector<int> p(n), size(n), got(n);
    vector<bool> passed(n);

    for (i = 1; i < n; ++i)
    {
        cin >> p[i];
        children[p[i] - 1].push_back(i);
    }

    init(children, size, 0);

    int low = 1;
    int high = n;
    int ans = n;

    while (low <= high)
    {
        int mid = (low + high) / 2;
        
        if (dfs(children, got, passed, 0, mid) == 0)
        {
            ans = mid;
            high = mid - 1;
        }

        else
            low = mid + 1;
    }    

    string s(n, '0');
    s[0] = '1';

    for (i = 0; i < n; ++i)
    {
        if (size[i] - 1 > ans)
            s[i] = '1';
    }

    dfs(children, got, passed, 0, ans - 1);

    if (got[0] == ans)
    {
        passed[0] = true;

        for (i = 1; i < n; ++i)
        {
            passed[i] = (passed[i] && passed[p[i]]);

            if ((size[i] == ans + 1) && passed[i])
                s[i] = '1';
        }
    }

    cout << s << "\n";
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1;
    cin >> t;

    while (t--)
    {
        solve();
    }
}