算法与数据结构考研试题精析-第６章算法设计题70

写一非递归算法求二叉树叶子结点的数量

#include <stdio.h>
#include <stdlib.h>
#define maxsize 100
#define OK 1
#define ERROR 0
typedef int Status;

typedef struct Node
{
    char data;
    struct Node *lchild,*rchild;
}Node,*BiTree;

typedef struct
{
    BiTree H[maxsize];
    int top;
}Stack;

BiTree Pop(Stack *S);
void Push(Stack *S,BiTree n);
Status Empty(Stack S);
int CreateBiTree(BiTree *T);
int LeafNodeCount(BiTree T);


int main()
{
    BiTree T;
    T=(BiTree)malloc(sizeof(Node));

    int n;

    CreateBiTree(&T);
    n=LeafNodeCount(T);

    printf("There are %d leaf nodes.\n",n);

    return 0;
}
int CreateBiTree(BiTree *T)
{
    fflush(stdin);
    printf("please input the node data:");
    char ch;
    scanf("%c",&ch);

    *T=(BiTree)malloc(sizeof(Node));
	(*T)->data=ch;

	char c;
	fflush(stdin);
	printf("Dose %c has leftchild(y--yes,n--no):",ch);
	scanf("%c",&c);
	if(c=='y')
		CreateBiTree(&(*T)->lchild);
	else
		(*T)->lchild=NULL;
	fflush(stdin);
    printf("Dose %c has rightchild(y--yes,n--no):",ch);
	scanf("%c",&c);
	if(c=='y')
		CreateBiTree(&(*T)->rchild);
	else
		(*T)->rchild=NULL;
    return 0;
}
BiTree Pop(Stack *S)
{
    if(S->top>0)
        return S->H[--S->top];
    else
    {
        printf("The stack is EMPTY !\n");
        exit(0);
    }

}
void Push(Stack *S,BiTree n)
{
    S->H[S->top++]=n;
}
Status Empty(Stack S)
{
    return S.top==0;
}
int LeafNodeCount(BiTree T)
{
    Stack S;
    S.top=0;
    int n=0;

    if(!T)
    {
        printf("The Binary Tree is EMPTY !\n");
        return 0;
    }
    else
        Push(&S,T);
    BiTree t;
    t=(BiTree)malloc(sizeof(Node));
    while(!Empty(S))
    {
        t=Pop(&S);
        if(!t->lchild && !t->rchild)
            n++;
        else
        {
            if(t->lchild)
                Push(&S,t->lchild);
            if(t->rchild)
                Push(&S,t->rchild);
        }
    }
    free(t);
    return n;
}