Distances

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
 
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef long double ld; 
typedef pair<ld,ld> state;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;

vi adj[222];
int par[222];

void dfs(int u, int p=-1)
{
	par[u]=p;
	for(int v:adj[u])
	{
		if(v==p) continue;
		dfs(v,u);
	}
}

vi dp[222];
void build(int u)
{
	vi res = {u};
	for(int v:adj[u])
	{
		build(v);
		if(adj[v].empty())
		{
			res.pb(v);
		}
		else
		{
			for(int w:adj[v])
			{
				vi lul = dp[w];
				for(int x:lul) res.pb(x);
			}
			res.pb(v);
		}
	}
	dp[u]=res;
}

void solve()
{
	int n; cin>>n;
	for(int i=0;i<n;i++) dp[i].clear();
	for(int i=0;i<n-1;i++)
	{
		int u,v; cin>>u>>v; u--; v--;
		adj[u].pb(v); adj[v].pb(u);
	}
	dfs(0);
	for(int i=0;i<n;i++) adj[i].clear();
	for(int i=1;i<n;i++) adj[par[i]].pb(i);
	build(0);
	vi res = dp[0];
	for(int x:res)
	{
		cout<<x+1<<' ';
	}
	cout<<'\n';
	for(int i=0;i<n;i++) adj[i].clear();
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	int t; cin>>t;
	while(t--) solve();
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED