int CountLeaf1(SqBiTree bt, int k) |
{ /*一维数组bt[2k-1]为二叉树存储结构,k 为二叉树深度,函数值为叶子数。*/ |
total=0; |
for ( i=1; i<=2k-1; i++ ) |
{ |
if ( bt[i]!=0 ) |
{ |
if ( ( bt[2i]==0 && bt[2i+1]==0 ) || ( i> ( 2k-1 ) /2 ) ) |
total++; |
} |
} |
return ( total ); |
} |