孩子兄弟表示法
typedef struct CSNode
{
ElemType data;
struct CSNode *firstchild,*nextsibling;
}CSNode,*CSTree;
void Degree(CSTree T,int &max)
{
if(T==NULL)
return;
if(T->firstchild)
{
p=T->firstchild;
n=1;
while(p->nextsibling)
{
p=p->nextsibling;
n++;
}
if(n>max)
max=n;
}
Degree(T->frstchild,max);
Degree(T->nextsibling,max);
}
int Height(CSTree T)
{
int hc,hs;
if(T==NULL)
return 0;
else
{
hc=Height(T->firstchild);
hs=Height(T->nextsibling);
if(hc+1>hs)
return hc+1;
return hs;
}
}