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
在这里插入图片描述

注意交换了0次也属于同构。如果均为空则同构,如果仅一个为空,则不同构。如果均不为空,但对应结点的值不同,则不同构,考虑了这几种基线情况后,其他递归判断就可以了,要么左左右右对应相等,要么左右右左对应相等。
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;
	return Isomorphic(T1->Left,T2->Left)&&Isomorphic(T1->Right,T2->Right)||Isomorphic(T1->Left,T2->Right)&&Isomorphic(T1->Right,T2->Left);
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值