Distances

#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)

using namespace std;

using ll = long long;

const int MAXN = 105;
vector<int> adj[MAXN];
vector<int> order;
void dfs(int n, int par, bool skip) {
    if (!skip) {
        order.push_back(n);
    }
    for (int e : adj[n]) {
        if (e != par) {
            dfs(e, n, !skip);
        }
    }
    if (skip) {
        order.push_back(n);
    }
}
int main() {
	cin.tie(0);
	cin.sync_with_stdio(0);
	int T;
	cin >> T;
	while (T-->0) {
        int N;
        cin >> N;
        order.clear();
        FR(i, N) {
            adj[i].clear();
        }
        FR(i, N-1) {
            int a, b;
            cin >> a >> b;
            a--, b--;
            adj[a].push_back(b);
            adj[b].push_back(a);
        }
        dfs(0, 0, false);
        for (int i = 0; i < N; i++) {
            cout << order[i]+1 << " ";
        }
        cout << '\n';
	}
	return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED