4-11 Isomorphic

小萨摩！

已于 2022-10-31 19:03:55 修改

阅读量253

点赞数

分类专栏： hbu数据结构文章标签：数据结构

于 2022-10-23 22:06:19 首次发布

本文链接：https://blog.csdn.net/manerzi/article/details/127481645

版权

hbu数据结构专栏收录该内容

74 篇文章 22 订阅

订阅专栏

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.

在这里插入图片描述

Figure 1

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):

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

在这里插入图片描述

Figure2
代码长度限制
16 KB
时间限制
400 ms
内存限制
64 MB
C (gcc)

思路：

树的同构就是判断两个树是否翻转相等。
如果都为空，同构；如果一个为空，另一个不为空，不同构；如果都不为空但两个树的元素不相等，不同构。
其他的递归实现即可，左左相等，右右相等或者左右，右左对应相等。

代码样例：

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);
}