Distances

#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 105;
vector<int> T[N];
vector<int> ord;
 
void dfs(int u, int pp){
    ord.push_back(u);
    for(auto x : T[u]){
        if(x==pp) continue;
        for(auto y : T[x]){
            if(y == u) continue;
            dfs(y,x);
        }
        ord.push_back(x);
    }
}
 
void solve(){
    int n;
    cin >> n;
    for(int i = 1; i <= n; i ++ ){
        T[i].clear();
    }
    int u, v;
    for(int i = 1; i < n; i ++ ){
        cin >> u >> v;
        T[u].push_back(v);
        T[v].push_back(u);
    }
    ord.clear();
    dfs(1,-1);
    for(auto q : ord){
        cout << q << " ";
    }
    cout << "\n";
}
 
int main(){
    int tc;
    cin >> tc;
    for(int t = 1; t <= tc; t ++ ){
        solve();
    }
    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED