应用二叉树基本编程

建树操作

BTreeNode* BuildBTreeNode(){   // 建树
    struct BTreeNode* p;
    int num;
    cin>>num;
    if(num==0)
        p=nullptr;
    else{
        p=(struct BTreeNode*)malloc(sizeof(struct BTreeNode));
        p->data = num;
        p->l=BuildBTreeNode();
        p->r=BuildBTreeNode();
    }
    return p;
}

四种遍历方法

void bfs(BTreeNode* node){      // 层序遍历
    
    queue<BTreeNode*> q;
    if(node){
        q.push(node);
    }
    while(!q.empty()){
        struct BTreeNode* p;
        p=q.front();
        q.pop();
        cout<<p->data<<" ";
        if(p->l)
            q.push(p->l);
        if(p->r)
            q.push(p->r);
    }
}
void preOrder(BTreeNode* node){    //先序遍历
    if(node){
        cout<<node->data<<" ";
        preOrder(node->l);
        preOrder(node->r);
    }
}
void inOrder(BTreeNode* node){     //中序遍历
    if(node){
        inOrder(node->l);
        cout<<node->data<<" ";
        inOrder(node->r);
    }
}
void lastOrder(BTreeNode* node){     //后序遍历
    if(node){
        lastOrder(node->l);
        lastOrder(node->r);
        cout<<node->data<<" ";
    }
}

查询叶子结点个数

int Leafnum(struct BTreeNode* node){   //叶子结点个数
    if(!node)
        return 0;
    else if((node->l == nullptr)&&(node->r==nullptr))
        return 1;
    else
        return Leafnum(node->l)+Leafnum(node->r);
}

• 整段代码如下

#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
struct BTreeNode{    //二叉树
    int data;
    struct BTreeNode* l;
    struct BTreeNode* r;
};
BTreeNode* BuildBTreeNode(){   // 建树
    struct BTreeNode* p;
    int num;
    cin>>num;
    if(num==0)
        p=nullptr;
    else{
        p=(struct BTreeNode*)malloc(sizeof(struct BTreeNode));
        p->data = num;
        p->l=BuildBTreeNode();
        p->r=BuildBTreeNode();
    }
    return p;
}


void bfs(BTreeNode* node){      // 层序遍历
    
    queue<BTreeNode*> q;
    if(node){
        q.push(node);
    }
    while(!q.empty()){
        struct BTreeNode* p;
        p=q.front();
        q.pop();
        cout<<p->data<<" ";
        if(p->l)
            q.push(p->l);
        if(p->r)
            q.push(p->r);
    }
}
void preOrder(BTreeNode* node){    //先序遍历
    if(node){
        cout<<node->data<<" ";
        preOrder(node->l);
        preOrder(node->r);
    }
}
void inOrder(BTreeNode* node){     //中序遍历
    if(node){
        inOrder(node->l);
        cout<<node->data<<" ";
        inOrder(node->r);
    }
}
void lastOrder(BTreeNode* node){     //后序遍历
    if(node){
        lastOrder(node->l);
        lastOrder(node->r);
        cout<<node->data<<" ";
    }
}
int Leafnum(struct BTreeNode* node){   //叶子结点个数
    if(!node)
        return 0;
    else if((node->l == nullptr)&&(node->r==nullptr))
        return 1;
    else
        return Leafnum(node->l)+Leafnum(node->r);
}
int main(int argc, const char * argv[]) {
    struct BTreeNode* node = nullptr;
    node = BuildBTreeNode();
    bfs(node);
//    preOrder(node);
//    cout<<endl;
//    inOrder(node);
//    cout<<endl;
//    lastOrder(node);
//    cout<<endl;
//    cout<<Leafnum(node)<<endl;
    return 0;
}