#include <bits/stdc++.h> using namespace std; const int N = 30; int w1[N], l1[N], r1[N], idx1=1, root1; int w2[N], l2[N], r2[N], idx2=1, root2; string pre1; string pre2; string in1; string in2; void insert1(int &u, int x){ if (!u){ u = idx1 ++; w1[u] = x; } else if (x < w1[u]...