判断二叉树相似代码.doc

判断二叉树相似 #includestdio.h#include stdlib.htypedef int ElementType;struct TreeNode;typedef struct TreeNode *Position;typedef struct TreeNode *SearchTree;struct TreeNode{ ElementType Element; SearchTree Left; SearchTree Right;};SearchTree MakeEmpty( SearchTree T);SearchTree Insert(ElementType X, SearchTree T);int Compare(SearchTree T, SearchTree Q); void main(void){ int n,l,o; int i,j,k; int a[100],b[100]; SearchTree P,S; P = NULL; S = NULL;  scanf(%d %d,n,l);/*input n and l*/  if (n!=0){ P = MakeEmpty(P); for(i=1;i=n;i++){ scanf(%d,a[i]);/*input the initially inserted numbers*/ P = Insert(a[i],P); } for(k=1;k=l;k++){ /*input L lines of integers*/ S=MakeEmpty(S); for(j=1;j=n;j++){ scanf(%d,b[j]); S=Insert(b[j],S); }  o=Compare(P, S); if (o==0) printf(No\n); else printf(Yes\n); } }} SearchTree MakeEmpty( SearchTree T){ if(T!=NULL) { MakeEmpty(T-Left); MakeEmpty(T-Right); free(T); } return NULL;}SearchTree Insert(ElementType X, SearchTree T)/*insert all the integers and build the searchtree*/{ if(T == NULL) { T= ( struct TreeNode *)malloc( sizeof( struct TreeNode ) ); if(T == NULL) { /*FatalError( Out of space!!! );*/ printf(Out of space!!!\n); return NULL; } else { T-Element = X; T-Left = T-Right = NULL; } } else if(XT-Element) T-Left=Insert(X,T-Left); else if(XT-Element) T-Right=Insert(X,T-Right); return T;}int Compare(SearchTree T, SearchTree Q)/*compare elements of the two trees one by one to know whether they are totally the same*/{ if(T==NULL Q==NULL) return 1; else if(T!=NULL Q!=NULL) { if(T-Element==Q-Element) return