PAT数据结构与算法题目集：7-3 树的同构

题目

代码

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;

const int N = 15, M = 2 * N;
int n;
int h[N], e[M], ne[M], idx, ed[N];
bool st[N];
char mmp[N];

string tr[2];

void add(int a, int b) {
	e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}

//判断儿子的大小关系并交换. 
void mswap(int u) {
	int left = -1, right = -1;

	left = h[u];	//取左儿子的地址
	if (left == -1) return;
	right = ne[h[u]];	//取右儿子的地址
	if (right == -1) return;

	//如果左儿子比右儿子大，那么交换左右子树 
	if (e[left] > e[right]) {
		h[u] = right;
		ne[right] = left;
		ne[left] = -1;
	}
}

//遍历 
void dfs(int u, string &tr) {
	st[u] = true;

	mswap(u);
	tr += mmp[u];

	for (int i = h[u]; i != -1; i = ne[i]) {
		int v = e[i];
		if (st[v]) continue;
		dfs(v, tr);
	}

}

int main() {
	for (int k = 0; k < 2; k++) {
		memset(h, -1, sizeof h);
		memset(e, 0, sizeof e);
		memset(ne, 0, sizeof ne);
		idx = 0;
		memset(ed, 0, sizeof ed);
		memset(st, 0, sizeof st);
		memset(mmp, 0, sizeof mmp);

		cin >> n;
		for (int i = 0; i < n; i++) {
			char ch, a, b;
			cin >> ch >> a >> b;
			//i连a,i连b 
			mmp[i] = ch;
			//只有1个儿子，无法区分左右儿子 
			if (b != '-') add(i, b - '0'), ed[b - '0']++;
			if (a != '-') add(i, a - '0'), ed[a - '0']++;
		}
		//找根节点，就是入度为0的结点
		int root = 0;
		for (int i = 0; i < n; i++)
			if (ed[i] == 0) {
				root = i;
				break;
			}
		dfs(root, tr[k]);
	}

	if (tr[0] == tr[1]) cout << "Yes" << endl;
	else cout << "No" << endl;

	return 0;
}