4-11 Isomorphic【同构的】 (10分)

4-11 Isomorphic (10分)

【同构的】
Two trees, T1 and T2, are isomorphic if T1 can be transformed into T2 by swapping left and right children of (some of the) nodes in T1. For instance, the two trees in Figure 1 are isomorphic because they are the same if the children of A, B, and G, but not the other nodes, are swapped. Give a polynomial time algorithm to decide if two trees are isomorphic.

Format of functions:

int Isomorphic( Tree T1, Tree T2 );

where Tree is defined as the following:

typedef struct TreeNode *Tree;
struct TreeNode {
    ElementType Element;
    Tree  Left;
    Tree  Right;
};

The function is supposed to return 1 if T1 and T2 are indeed isomorphic, or 0 if not.

Sample program of judge:

#include <stdio.h>
#include <stdlib.h>

typedef char ElementType;

typedef struct TreeNode *Tree;
struct TreeNode {
    ElementType Element;
    Tree  Left;
    Tree  Right;
};

Tree BuildTree(); /* details omitted */

int Isomorphic( Tree T1, Tree T2 );

int main()
{
    Tree T1, T2;
    T1 = BuildTree();
    T2 = BuildTree();
    printf(“%d\n”, Isomorphic(T1, T2));
    return 0;
}

/* Your function will be put here */

Sample Output 1 (for the trees shown in Figure 1):

1

Sample Output 2 (for the trees shown in Figure 2):

0

全AC，but

视频数据结构-浙江大学
大佬写的呢！

下面两个思路只差最后一个if语句，但是如果我将上面这个答案else后面输出的语句写的奇怪一点，就可以通过，但是不符合语法啊，下面那个是正常的思路，大家可以接受，上面做这个也不知道怎么回事就可以运行成功了？
奇奇怪怪的。

奇奇怪怪

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==NULL&&T2->Left==NULL)
		//左子树为空，比较右子树
		return  Isomorphic(T1->Right,T2->Right);
	else
		//判断同构现象
//错误的 return (Isomorphic(T1->Left,T2->Right)&&Isomorphic(T1->Right,T2->Left));
    	return (Isomorphic(T1->Left,T2->Right)&&(T1->Right,T2->Left)); 
}

这才是正确的判断思路

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==NULL&&T2->Left==NULL)
		//左子树为空，比较右子树
		return  Isomorphic(T1->Right,T2->Right);
	if(T1->Left&&T2->Left&&T1->Left->Element==T2->Left->Element)
		return Isomorphic(T1->Right,T2->Right)&&Isomorphic(T1->Left,T2->Left);
	else
		//判断同构现象
		return (Isomorphic(T1->Left,T2->Right)&&Isomorphic(T1->Right,T2->Left));
//    	return (Isomorphic(T1->Left,T2->Right)&&(T1->Right,T2->Left));
}