문제 링크 : boj.kr/1991난이도 : S1태그 : 트리, 재귀코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;void traversal(vector tree, int node, int mode) { if(node == -19) return; auto [l, r] = tree[node]; if(mode == -1) cout > n; vector tree(n); for(int i = 0; i > a >> b >> c; ..