//求节点数#include#include#include#defineTRUE1#defineFLASE0#defineOK1#defineERROR0#defineINFEASIBLE-1#defineOVERFLOW-2typedefintStatus;typedefintTElemType;typedefstructBiTNode{TElemTypedata;structBiTNode*lchild,*rchild;}BiTNode,*BiTree;StatusCreateBiTree(BiTree&T){TElemTypee;scanf("%d",&e);if(e==0)T=NULL;else{T=(BiTree)malloc(sizeof(BiTNode));if(!T)exit(OVERFLOW);T->data=e;CreateBiTree(T->lchild);CreateBiTree(T->rchild);}returnOK;}intBTNodeCount(BiTreeT){intm=0,n=0;if(T==NULL)return0;else{m=BTNodeCount(T->lchild);n=BTNodeCount(T->rchild);return(m+n+1);}}voidmain(){BiTreeT;printf("请输入二叉树中节点的值（int型），0表示空树:\n");CreateBiTree(T);printf("该树的节点数是%d\n",BTNodeCount(T));}//求叶子数#include#include#include#defineTRUE1#defineFLASE0#defineOK1#defineERROR0#defineINFEASIBLE-1#defineOVERFLOW-2typedefintStatus;typedefintTElemType;typedefstructBiTNode{TElemTypedata;structBiTNode*lchild,*rchild;}BiTNode,*BiTree;StatusCreateBiTree(BiTree&T){TElemTypee;scanf("%d",&e);if(e==0)T=NULL;else{T=(BiTree)malloc(sizeof(BiTNode));if(!T)exit(OVERFLOW);T->data=e;CreateBiTree(T->lchild);CreateBiTree(T->rchild);}returnOK;}intLeftBiTree(BiTreeT){intm,n;if(!T)return0;elseif(!T->lchild&&!T->rchild)return1;else{m=LeftBiTree(T->lchild);n=LeftBiTree(T->rchild);return(m+n);}}voidmain(){BiTreeT;printf("请输入树中节点的值（int型），0表示空树:\n");CreateBiTree(T);printf("该二叉树的树叶是%d\n",LeftBiTree(T));}如果需要两个程序合并，自己修改一下就可以了#include#includetypedefcharElemType;#include"BiTree.h"typedefBiTreeNode*DataType;#include"LinQueue.h"voidLeverOrder(BiTreeNode*root)//层序遍历的函数，形参是一个二叉树的头指针，如果该二叉树有头结点则为其头结点的左子树{intm=0,n=0;//m为叶子节点的计数器，n为总节点BiTreeNode*q;LQueuehead;//创建一个队列，用以存放二叉树的结点地址QueueInitiate(&head);//初始化队列QueueAppend(&head,root);//二叉树第一个有用结点入队列while(QueueNotEmpty(head)){QueueDelete(&head,&q);printf("%c",q->data);n++;//输出一个结点就进行一次计数，总计为总结点数目if(q->leftChild!=NULL)QueueAppend(&head,q->leftChild);if(q->rightChild!=NULL)QueueAppend(&head,q->rightChild);if(q->leftChild==NULL&&q->rightChild==NULL)m++;//叶子节点为没有子树的结点，利用这个特点进行筛选}printf("\n");printf("总结点数目为：%d\n",n);printf("叶子节点数目为：%d\n",m);}voidmain(){BiTreeNode*root,*p,*pp;Initiate(&root);p=InsertLeftNode(root,'A');p=InsertLeftNode(p,'B');p=InsertLeftNode(p,'D');p=InsertRightNode(p,'G');p=InsertRightNode(root->leftChild,'C');pp=p;InsertLeftNode(p,'E');InsertRightNode(pp,'F');LeverOrder(root->leftChild);Destroy(&root);}
