题解分享
题解分享简介
树的深度优先遍历 - 题解
```cpp
// https://dashoj.com/p/130
#include <bits/stdc++.h>
using namespace std;
int n;
map<int, vector<int>> tree;
void dfs(int x) {
cout << x << ' ';
sort(tree[x].begin(), tree[x].end());
for (int i: tree[x]) dfs(i);
}
int main() {
cin >> n;
for (int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
tree[x].push_back(y);
}
dfs(1);
cout << endl;
return 0;
}
```
查看全文
0
0
1
1
