多媒體教學(xué)系統(tǒng)第6章

1、第六章一、填空題1、葉子 2、73、414、55、106、3二、選擇題1、C 2、D 3、B 4、B 5、C 6、A 7、A三、應(yīng)用題1、先序：ABCDEFGHI 中序：BCDAFEHIG 后序：DCBFIHGEA2、 編碼：A：11 B：10 C：00 D：010 E：0113、四、程序填空1、printf(%cn,root-data); 2、*bt=(BiTree)malloc(sizeof(BTreeNode);3、PreOrder(root-rchild); 4、return(n1+n2+n);5、CreateBiTree(&R);五、算法設(shè)計(jì)題1、#include #define M

2、AXSIZE 100#define DATATYPE2 chartypedef struct node DATATYPE2 data; struct node * lchild,* rchild;BTLINK;BTLINK *createbt() BTLINK *qMAXSIZE;BTLINK *s;char n;int i,j;printf(輸入二叉樹各結(jié)點(diǎn)的編號(hào)和值：n);scanf(%d,%c,&i,&n);while(i!=0 & n!= $)s=(BTLINK *)malloc(sizeof(BTLINK);s-data=n;s-lchild=NULL;s-rchild=NULL;q

3、i=s;if(i!=1)j=i/2;if(i%2= =0)qj-lchild=s;elseqj-rchild=s;printf(輸入二叉樹各結(jié)點(diǎn)的編號(hào)和值：n);scanf(%d,%c,&i,&n);return(q1);BTLINK *search(BTLINK *bt,char x)BTLINK *temp;if(bt= =NULL)return NULL;if(x= =bt-data)return bt;temp=search(bt-lchild,x);if(temp!=NULL)return temp;elsereturn search(bt-rchild,x);BTLINK *par

4、ent(BTLINK *bt,BTLINK *q)BTLINK *p;if(bt= =NULL)return NULL;if(bt-lchild= =q|bt-rchild= =q)return bt;p=parent(bt-lchild,q);if(p!=NULL)return p;elsereturn parent(bt-rchild,q);main()BTLINK *bt,*temp,*p;char x;bt=createbt();printf(輸入要查找雙親結(jié)點(diǎn)的數(shù)據(jù)：);scanf(%c,&x);temp=search(bt,x);if(temp= =NULL)printf(無(wú)此結(jié)點(diǎn)！);else if(temp= =bt)printf(無(wú)雙親結(jié)點(diǎn)，是根結(jié)點(diǎn)！);elsep=parent(bt,temp);printf(雙親結(jié)點(diǎn)為：%c,p-data);2、typedef struct node char data; struct node * lchild,* rchild;BTLINK;int count(BTLINK T,int a) int s