【7076】二叉树的叶子节点数

关注公众号程序猿从入门到入土查询更方便哦

#include <iostream>
#include <stdio.h>
#define MAXSIZE 10000
using namespace std;

typedef struct bitnode{

    char data;
    struct bitnode* lChild,*rChild;

}BiTNode,*BiTree;


void CreateBiTree(BiTree &t){
    char a;
    cin>>a;
    if(a=='@'){
        t=NULL;
    }
    else{
        t=new BiTNode;
        t->data=a;
        CreateBiTree(t->lChild);
        CreateBiTree(t->rChild);
    }

}



int Depth(BiTree t){
    int m=0,n=0;
    if(t==NULL){
        return 0;
    }
    else{
        m=Depth(t->lChild);
        n=Depth(t->rChild);
        if(m>n){
            return m+1;
        }
        else{
            return n+1;
        }
    }
}

void PreOutBiTree(BiTree t){

    if(t){
        cout<<t->data<<" ";
        PreOutBiTree(t->lChild);
        PreOutBiTree(t->rChild);
    }
}

void BackOutBiTree(BiTree t){
    if(t){
        BackOutBiTree(t->lChild);
        BackOutBiTree(t->rChild);
        cout<<t->data;
    }
}

void LeafNum(BiTree t,int &num){
    if(t){
        if(t->lChild==NULL&&t->rChild==NULL){
            num++;
            return;
        }
        else{
            LeafNum(t->lChild,num);
            LeafNum(t->rChild,num);
        }
    }
}

void MidOutBiTree(BiTree t){
    if(t){
        MidOutBiTree(t->lChild);
        cout<<t->data;
        MidOutBiTree(t->rChild);

    }
}


int main()
{
    BiTree t;
    char dataArr[MAXSIZE];
    CreateBiTree(t);

    int num=0;
    LeafNum(t,num);
    cout<<num;
    return 0;
}