叶子结点统计.txt

一个叶子算法程序

#include<iostream.h>
#include<stulib.h>

struct ABTreeNode{
    int data;
    int left,right;
}


int  CreateBTree(BTreeNode &T )//建立二叉树（递归）

{
 cin>>ch;
  if(ch=='  ') T = NULL;
  else {
      T= new(BTreeNode);
      T->data = ch;
      CreateBTree(T->left);
      CreateBTree(T->right); 
}
return 1;
}
void count(BTreeNode * BT,int &c1,int &c2)
{
 if(BT!=NULL)
    c1++;
    if(BT->left=NULL&&BT->right==NULL)
       c2++;
    count(BT->left,c1,c2);
    count(BT->right,c1,c2);
  }
}
void main()
{
  CreateBTree(BTreeNode &T );
  count(BTreeNode * BT,int &c1,int &c2);
}