数据结构相关-zju课件hw3a.pdfVIP

p.1394.42

Twotrees,TandT,areisomorphicifTcanbetransformed

121

intoTbyswappingleftandrightchildrenof(someofthe)

2

nodesinT1.Forinstance,thetwotreesinFigure4.63are

isomorphicbecausetheyarethesameifthechildrenofA,

B,andG,butnottheothernodes,areswapped.

a.Giveapolynomialtimealgorithmtodecideiftwotrees

areisomorphic.

*b.Whatistherunningtimeofyourprogram(thereisa

linearsolution)?

Figure4.63

AA

BCCB

DEGGED

FHHF

typedefstructTreeNode*PtrToNode;

typedefPtrToNodeTree;

structTreeNode{

ElementTypeElement;

TreeLeft;

TreeRight;

}

#defineTrue1;

#defineFalse0;

intIsomorphic(TreeT1,TreeT2)

{/*Thealgorithmdecidesiftwotreesareisomorphicby*/

/*preordertraversal.Itisassumedthatalltheelements*/

/*ofatreearedistinct.*/

/*Visitthisnodefirst*/

if((T1Null)(T2Null))/*bothempty*/

returnTrue;

if(((T1Null)(T2!=Null))||((T1!=Null)(T2Null)))

returnFalse;/*oneofthemisempty*/

if(T1-Element!=T2-Element)

returnFalse;/*rootsarediffere