Question 2:

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

int main() {
  int n;
  cin >> n;
  vector<vector<int>> adj(n + 1);
  for (int i = 2; i <= n; i++) {
    int x;
    cin >> x;
    adj[i].push_back(x);
    adj[x].push_back(i);
  }
  vector<int> subtree(n + 1, 0);

  function<int(int, int)> dfs = [&](int u, int p) -> int {
    int ans = 1;
    for (int v : adj[u]) {
      if (v != p) {
        ans += dfs(v, u);
      }
    }
    return subtree[u] = ans;
  };
  dfs(1, 0);

  for (int i = 1; i <= n; i++) {
    cout << subtree[i] - 1 << " ";
  }
  cout << "\n";
}