Re: no :of nodes

In article
<7521541f-9a67-4239-93d5-1452d442314c@[EMAIL PROTECTED]
>,
sophia  <sophia.agnes@[EMAIL PROTECTED]
> wrote:

>How good is this function which is used to find  the no: of nodes
>in each level of the binary tree. ?

>int arrlev[100];

>void preorder(struct btree *n,int lev)
>{
>       if(!(n))
>       return;
>
>       arrlev[lev]++;

When you restrict the number of levels in the counters (which
you do in your declaration of arrlev), then before you write
into arrlev[lev] you need to check that you are not overflowing
the end of the array.

>       lev++;
>
>      preorder(n->left,lev);
>      preorder(n->right,lev);

You could avoid a bunch of do-nothing calls:

      if (n->left) preorder(n->left,lev);
      if (n->right) preorder(n->right,lev);

>}


-- 
  "I want to be remembered as the guy who gave his all whenever
  he was on the field."                       -- Walter Payton