6_3.txt

来自「数据结构及算法经典 讲述数据结构的经典算法c源程序」· 文本 代码 · 共 32 行

#include<stdio.h>
#define maxsize 100
typedef struct node{
  char data;
  struct node *lchild,*rchild;
 }bt;


createbt(bt **T)
 {
  char ch;
  scanf("%c",&ch);
  if(ch==' ')*T=NULL;
   else{
   *T=(bt *)malloc(sizeof(bt));
   (*T)->data=ch;
   createbt(&((*T)->lchild));
   createbt(&((*T)->rchild));
   }
 }
counttrav(bt *t)
{
 if(!t)return 0;
  else
   return(1+counttrav(t->lchild)+counttrav(t->rchild)); 
}
main()
{
 bt *h;
 createbt(&h);
 printf("total=%d\n",counttrav(h));
}