解题代码
int Isomorphic(Tree T1, Tree T2) {
if (!T1 && !T2) return 1;
if (!T1&&T2 || T1 && !T2) return 0;
if (T1->Element != T2->Element) return 0;
if (!T1->Left && !T2->Left || T1->Left&&T2->Left&&T1->Left->Element == T2->Left->Element) return Isomorphic(T1->Right, T2->Right);
else return (Isomorphic(T1->Left, T2->Right) && Isomorphic(T1->Right, T2->Left));
}
测试结果
问题整理
1.这题已经很熟练了~