数据结构考研分类复习真题 第六章 答案 (五)[33]

int BTLC(BiTree Tint *c)//对二叉树T的结点计数

{if(T)

{*c++;

BTLC(T>lchild&c); //统计左子树结点

BTLC(T>rchild&c); //统计右子树结点

} }//结束Count调用时*c=

int Count(CSTree t)//统计以孩子兄弟链表表示的树的叶子结点个数

{if(t==null) return();

else if(t>firstlchild==null) //左子女为空结点必为叶子

return(+Count(t>nextsibling)) //（叶子）+兄弟子树上的叶子结点

else return(Count(t>firstchild)+Count(t>nextsibling));//子女子树+兄弟子树

}//Count

void Count(BiTree btint *n*n) //统计二叉树bt上叶子结点数n和非叶子结点数n

{if(bt)

{if (bt>lchild==null && bt>rchild==null) *n++//叶子结点

else *n++; //非叶结点

Count(bt>lchild&n&n);

Count(bt>rchild&n&n);

} }//结束 Count

[] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] [] []