bitree.h

一个c语言编写的求二叉树叶子结点个数的程序

#include <stdio.h>
#include <stdlib.h>

typedef struct bnode
{
        int data;
        struct bnode  *lchild,*rchild;
                      
        }btree;
btree *insert_node(btree *root,int node)
{      
   btree *newpointer;
   btree *currentpointer;
   btree *parentpointer;
   newpointer=(btree *)malloc(sizeof(btree));
   newpointer->data=node;
   newpointer->lchild=NULL;
   newpointer->rchild=NULL;
   if(root==NULL)
   {                 
    return newpointer;                        
                 }
    else
    {
      currentpointer=root;
      while(currentpointer!=NULL)
      {
         parentpointer=currentpointer;
         if(currentpointer->data->node)                        
       {
         currentpointer=currentpointer->lchild;                           
        
        }
     else
     {
         currentpointer=currentpointer->rchild;  
         
         }
}
if(parentpointer->data->node)
{
  parentpoint->lchild=newpointer;
 
 }
 else
 {
   parentpointer->rchild=newpointer;
    
     } 
  }
  return root;
}

btree *create_btree(int data[],int len)
{
      int i;
      btree *root= NULL;
      for(i=0;i<len;i++)
      {
        root=insert_node(root,data[i]);
                        
                        }
      return root;
      
      
      }