简易家谱图代码.docxVIP

#includeiostream.h#includestring.h#includestdlib.h#includestdio.h#includeconio.h#define TRUE 1#define FALSE !TRUE#define BitTreeElementType charchar *a[5]={父子,兄弟,堂兄弟,祖孙,共祖};typedefstruct Node{ charbiaozhi;char name[12];int age;charjop[12];}Node;typedefstructBitnode{BitTreeElementType data;structBitnode *parentreal; //逻辑双亲structBitnode *parent; //物理双亲structBitnode *lchild;structBitnode *rchild;}BTnode,*BitTree;Bitnode *l,*r;intCreateBiTree(BitTree T, char * str){ BitTreeElementTypeinputdata;inputdata=*str;if ( inputdata == #){ T = NULL;return FALSE;}else{ if(!(T=(BTnode *)malloc(sizeof(BTnode)))){ coutOverflow!;}T-data=inputdata;T-parent=NULL; T-parentreal=NULL;CreateBiTree(T-lchild,++str);CreateBiTree(T-rchild,++str); }return 1;} void parentset(BitTree T)//物理双亲{ if(TT-lchild){T-lchild-parent=T;T-lchild-parentreal=T;}if(TT-rchild)T-rchild-parent=T;if(T-lchild) parentset(T-lchild);if(T-rchild) parentset(T-rchild);} intparentrealset(BitTree T)//逻辑双亲{if(T-lchildT-lchild-rchild){ BitTree p; p=T;if(p=p-lchild) {while(p-rchild)p-rchild-parentreal=T,p=p-rchild;} }if(T-lchild) parentrealset(T-lchild);if(T-rchild) parentrealset(T-rchild);return 0;}int locate(BitTree T,BTnode x,BTnode y)//先序遍历定位{ if(T) {if(T-data==x.data) l=T;if(T-data==y.data) r=T;locate(T-lchild,x,y); locate(T-rchild,x,y);}return 0;} intxiongdi(BitTree T,BTnode *x,BTnode *y)//兄弟算法{BTnode *p,*q;locate(T,*x,*y); p=l;q=r;while(p-rchild!=qp-rchild) p=p-rchild;if(p-rchild==q) return 1;while(q-rchild!=pq-rchild) q=q-rchild;if(q-rchild==p) return 1;return -1;}intfuzi(BitTree T,BTnode *x,BTnode *y)//父子算法{ BTnode *p,*q;locate(T,*x,*y) ; p=l;q=r;if(p-parentreal==q||q-parentreal==p) return 0;return -1;}intzusun(BitTree T,BTnode *x,BTnode *y)//祖孙算法{BTnode *p,*q;locate(T,*x,*y) ; p=l;q=r;if((p-parentrealp-parentreal-parentreal==q)||(q-parentrealq-parentreal-parentreal==p)) return 3;return -1;}inttangxiongdi(BitTree T,BTnode *x,BTnode *y)//堂兄弟算法{BTnode *p,*q;locate(T,*x,*y) ; p=l;q=r;if( p-paren