二叉排序树算法

#include "stdio.h"
#include "string.h"
#include "malloc.h"

struct Student{
    char Stu_Number[20];//学号
    char Stu_Name[10];//姓名
    char Stu_Bedroom[10];//房间号
};

struct Student student[100];
int Num ;//用于统计总个数

//输入数据
void Create(){
    struct Student temp;
    int Continue;
    Num = 0;//数据个数初始为0
    while(1 ){
        printf("输入一个学生信息:\n");
        printf("学号:");
        scanf("%s",&temp.Stu_Number);
        printf("姓名:");
        scanf("%s",&temp.Stu_Name);
        printf("房间号:");
        scanf("%s",&temp.Stu_Bedroom);
        student[Num++] = temp;
        printf("\n");
        printf("继续|(1:Y,0:N):");
        scanf("%d",&Continue);
        while(Continue!=1&&Continue!=0)
        {
            printf("请输入0|1:");
            scanf("%d",&Continue);
        }
        if(Continue==0)
        {
            printf("数据输入结束!\n");
            break;
        }
    }
}


 struct Bnode{
     struct Student student;
     Bnode *lchild;
     Bnode *rchild;
};

/*
*将指针S所指的结点插入到二叉排序树T中  关键字(房号+学号)
*/
void RoomNum_Number_insert( Bnode * &Tree, Bnode *S)
{
    if(Tree==NULL)//若插入到空树时，插入结点为根结点
    {
        Tree = S;
    }else if(strcmp(S->student.Stu_Bedroom,Tree->student.Stu_Bedroom)<0){    
        RoomNum_Number_insert(Tree->lchild,S);//插入到Tree的左子树中
    }else if(strcmp(S->student.Stu_Bedroom,Tree->student.Stu_Bedroom)>0){
        RoomNum_Number_insert(Tree->rchild,S);//插入到Tree的右子树中
    }else if(strcmp(S->student.Stu_Bedroom,Tree->student.Stu_Bedroom)==0)//房号相同的情况下 再比较学号
    {
        if(strcmp(S->student.Stu_Number,Tree->student.Stu_Number)<0)
        {
            RoomNum_Number_insert(Tree->lchild,S);//插入到Tree的左子树中
        }else RoomNum_Number_insert(Tree->rchild,S);//插入到Tree的右子树中
    }
}


/*
*二叉排序树的构造  关键字(房号+学号)
*/
void RoomNum_Number_Create_bst(Bnode *&Tree)
{
    int i=0;
    Tree = NULL;
    Student x;
    while(i<Num)
    {
        x = student[i];
        Bnode *u;
        u = ( Bnode *)malloc(sizeof(Bnode));//分配存储区域
        u->student = x;
        u->lchild = NULL;
        u->rchild = NULL;
        RoomNum_Number_insert(Tree,u);
        i++;
    }
    printf("二叉排序树构造完毕!\n");
}


/*
*查找某个房间号的所有人 关键字(房号+学号)
*/
void Room_Num_inorder(Bnode *Tree,char temp[])
{
    if(Tree!=NULL)
    {
        Room_Num_inorder(Tree->lchild,temp);
        if (strcmp(Tree->student.Stu_Bedroom,temp)==0)
        {
            printf("房号:%s 学号:%s 姓名:%s\n",Tree->student.Stu_Bedroom,Tree->student.Stu_Number,Tree->student.Stu_Name);
        }
        Room_Num_inorder(Tree->rchild,temp);
    }
}


/*
*将指针S所指的结点插入到二叉排序树T中  关键字(姓名+学号)
*/
void Name_Number_insert(Bnode * &Tree,Bnode *S)
{
    if(Tree==NULL)//插入到空树时，插入结点为根结点
    {
        Tree = S;
    }else if(strcmp(S->student.Stu_Name,Tree->student.Stu_Name)<0){    
        Name_Number_insert(Tree->lchild,S);//插入到Tree的左子树中
    }else if(strcmp(S->student.Stu_Name,Tree->student.Stu_Name)>0){
        Name_Number_insert(Tree->rchild,S);//插入到Tree的右子树中
    }else if(strcmp(S->student.Stu_Name,Tree->student.Stu_Name)==0)//房号相同的情况下 再比较学号
    {
        if(strcmp(S->student.Stu_Number,Tree->student.Stu_Number)<0)
        {
            Name_Number_insert(Tree->lchild,S);//插入到Tree的左子树中
        }else Name_Number_insert(Tree->rchild,S);//插入到Tree的右子树中
    }
}


/*
*二叉排序树的构造  关键字(姓名+学号)
*/
void Name_Number_Create_bst(Bnode *&Tree)
{
    int i=0;
    Tree = NULL;
    Student temp;
    while(i<Num)
    {
        temp = student[i];
        Bnode *u;
        u = (Bnode *)malloc(sizeof(Bnode));//分配存储区域
        u->student = temp;
        u->lchild = NULL;
        u->rchild = NULL;
        Name_Number_insert(Tree,u);
        i++;
    }
    printf("二叉排序树构造完毕!\n");
}


/*
*查找同名的所有人 关键字(姓名+学号)
*/
void Name_Num_inorder(Bnode *Tree,char temp[])
{
    if(Tree!=NULL)
    {
        Name_Num_inorder(Tree->lchild,temp);
        if (strcmp(Tree->student.Stu_Name,temp)==0)
        {
            printf("姓名:%s 学号:%s 房号:%s\n",Tree->student.Stu_Name,Tree->student.Stu_Number,Tree->student.Stu_Bedroom);
        }
        Name_Num_inorder(Tree->rchild,temp);
    }
}


/*
*中序输出二叉排序树
*/
void inorder(Bnode *Tree)
{
    if(Tree!=NULL)
    {
        inorder(Tree->lchild);
        printf("房号:%s 学号:%s 姓名:%s\n",Tree->student.Stu_Bedroom,Tree->student.Stu_Number,Tree->student.Stu_Name);
        inorder(Tree->rchild);
    }
}


int main()
{

    Bnode *Tree_Room_Number;
    Tree_Room_Number = (Bnode *)malloc(sizeof(Bnode));//分配存储区域
    Bnode *Tree_Name_Number;
    Tree_Name_Number = (Bnode *)malloc(sizeof(Bnode));//分配存储区域

    int Continue;
    char name[20],room[20];
    while(1)
    {
        printf(" ------------------菜单---------------------\n");
        printf("|-----1:数据输入----------------------------|\n");
        printf("|-----2:二叉排序树(房号+学号)---------------|\n");
        printf("|-----3:查找同房号所有人--------------------|\n");
        printf("|-----4:二叉排序树(姓名+学号)---------------|\n");
        printf("|-----5:姓名查找同名的所有人----------------|\n");
        printf("|-----6:二叉排序树中序输出------------------|\n");
        printf(" -------------------------------------------\n");
        
        printf("请选择菜单:");
        scanf("%d",&Continue);
        while(Continue!=1&&Continue!=2&&Continue!=3&&Continue!=4&&Continue!=5&&Continue!=6)
        {
            printf("请输入1|2|3|4|5|6:");
            scanf("%d",&Continue);
        }
        switch(Continue)
        {
        case 1:
            Create();
            break;
        case 2:
            RoomNum_Number_Create_bst(Tree_Room_Number);//创建二叉排序树  关键字(房号+学号)
            break;
        case 3:
            printf("输入房间号:");
            scanf("%s",&room);
            Room_Num_inorder(Tree_Room_Number,room);
            break;
        case 4:
            Name_Number_Create_bst(Tree_Name_Number);//创建二叉排序树  关键字(姓名+学号)
            break;
        case 5:
            printf("输入姓名:");
            scanf("%s",&name);
            Name_Num_inorder(Tree_Name_Number,name);
            break;
        case 6:
            printf(" ------------查看(中序输出)-----------\n");
            printf("|-----1:二叉排序树(房号+学号)--------|\n");
            printf("|-----0:二叉排序树(姓名+学号)--------|\n");
            printf(" ------------------------------------\n");
            printf("请选择:");
            scanf("%d",&Continue);
            while(Continue!=1&&Continue!=0)
            {
                printf("输入有误，请输入0|1:");
                scanf("%d",&Continue);
            }
            if(Continue==1) inorder(Tree_Room_Number);
            else inorder(Tree_Name_Number);
            break;
        }
        printf("\n1:主菜单,0:退出  :");
        scanf("%d",&Continue);
        while(Continue!=1&&Continue!=0)
        {
            printf("输入有误，请输入0|1:");
            scanf("%d",&Continue);
        }
        if(Continue==0)break;
    }
    return 0;
}

 

宿舍管理查询软件（限2 人完成）
任务：为宿舍管理人员编写一个宿舍管理查询软件, 程序设计要求：
1) 输入数据 ，要求输入学号，姓名，房号。
2) 建立一棵二叉排序树。关键字（房号+学号)
3） 输入房号找到此房间的所有人，打印房号、学号、姓名
4） 建立一棵二叉排序树。关键字（姓名+学号)
5） 输入姓名找到同名的所有人，打印姓名、学号、房号

#include <iostream>
#include <string>
using namespace std;

enum error{rangeerror,overflow,underflow,success};

struct Infor{
    string Number;//学号
    string Name;//姓名
    int Room_Num;//房间号
};

struct node{
    Infor data;
    node *next;
};

class list{
public:
    list();
    int length() const;//求长度的函数
    int get_int(const int i ,Infor & x)const;//按序号取元素运算函数
    void  create();//创建链表
private:
    int count;
    node * head;
};

/*
*初始化对应的构造函数
*/
list::list(){
    head =new node;
    head->next=NULL;
    count=0;
}

/*
*求长度
*/
int list::length() const{
    return count;
}


/*
*创建链表,输入数据
*/
void list::create(){
    Infor Data;
    bool flags = true;//是否继续输入数据标识
    int select;
    node * rear=head;
    while(flags ){
        cout<<"请输入一组数据:"<<endl;
        cout<<"学号:";
        cin>>Data.Number;
        cout<<"姓名:";
        cin>>Data.Name;
        cout<<"房间号:";
        cin>>Data.Room_Num;
        cout<<endl;
        count++;
        node *s=new node;
        s->data=Data;
        rear->next=s;
        rear=s;
        rear->next=NULL;

        cout<<"继续输入数据?|(1:继续,0不继续):";
        cin>>select;
        while(select!=1&&select!=0)
        {
            cout<<"输入有误，请输入0|1:";
            cin>>select;
        }
        if(select==0)
        {
            flags = false;
            cout<<"数据输入完毕!"<<endl;
        }
    }
}

/*
*按序号取元素
*/
int list::get_int(const int i,Infor &x)const{
    node *p=new node;
    p=head->next;
    int j=1;
    while(p!=NULL&&j!=i){//当前节点不是目标节点，并且不空时就继续搜索
        p=p->next;
        j++;
    }
    if(p==NULL)return rangeerror;
    else {
        x=p->data;
        return success;
    }
}

struct Bnode{
    Infor data;
    Bnode *lchild;
    Bnode *rchild;
};


//---------------------关键字(房号+学号)-------------------
/*
*将指针S所指的结点插入到二叉排序树T中  关键字(房号+学号)
*/
void RoomNum_Number_insert(Bnode * &Tree,Bnode *S)
{
    if(Tree==NULL)//插入到空树时，插入结点为根结点
    {
        Tree = S;
    }else if(S->data.Room_Num<Tree->data.Room_Num){    
        RoomNum_Number_insert(Tree->lchild,S);//插入到Tree的左子树中
    }else if(S->data.Room_Num>Tree->data.Room_Num){
        RoomNum_Number_insert(Tree->rchild,S);//插入到Tree的右子树中
    }else if(S->data.Room_Num==Tree->data.Room_Num)//房号相同的情况下 再比较学号
    {
        if(S->data.Number<Tree->data.Number)
        {
            RoomNum_Number_insert(Tree->lchild,S);//插入到Tree的左子树中
        }else RoomNum_Number_insert(Tree->rchild,S);//插入到Tree的右子树中
    }
}

/*
*二叉排序树的构造  关键字(房号+学号)
*/
void RoomNum_Number_Create_bst(list A,Bnode *&Tree)
{
    int i=0;
    Tree = NULL;
    Infor x;
    while(i<A.length())
    {
        A.get_int(i+1,x);
        Bnode *u = new Bnode;
        u->data = x;
        u->lchild = NULL;
        u->rchild = NULL;
        RoomNum_Number_insert(Tree,u);
        i++;
    }
    cout<<"二叉排序树构造完毕!"<<endl;
}

/*
*查找某个房间号的所有人 关键字(房号+学号)
*/
void Room_Num_inorder(Bnode *Tree,int x)
{
    if(Tree!=NULL)
    {
        Room_Num_inorder(Tree->lchild,x);
        if (Tree->data.Room_Num == x)
        {
            cout<<"房号:"<<Tree->data.Room_Num <<" 学号:"<<Tree->data.Number<<" 姓名:"<<Tree->data.Name<<endl;
        }
        Room_Num_inorder(Tree->rchild,x);
    }
}

//---------------------关键字(房号+学号)-------------------



//---------------------关键字(姓名+学号)-------------------
/*
*将指针S所指的结点插入到二叉排序树T中  关键字(姓名+学号)
*/
void Name_Number_insert(Bnode * &Tree,Bnode *S)
{
    if(Tree==NULL)//插入到空树时，插入结点为根结点
    {
        Tree = S;
    }else if(S->data.Name<Tree->data.Name){    
        Name_Number_insert(Tree->lchild,S);//插入到Tree的左子树中
    }else if(S->data.Name>Tree->data.Name){
        Name_Number_insert(Tree->rchild,S);//插入到Tree的右子树中
    }else if(S->data.Name==Tree->data.Name)//房号相同的情况下 再比较学号
    {
        if(S->data.Number<Tree->data.Number)
        {
            Name_Number_insert(Tree->lchild,S);//插入到Tree的左子树中
        }else Name_Number_insert(Tree->rchild,S);//插入到Tree的右子树中
    }
}

/*
*二叉排序树的构造  关键字(姓名+学号)
*/
void Name_Number_Create_bst(list A,Bnode *&Tree)
{
    int i=0;
    Tree = NULL;
    Infor x;
    while(i<A.length())
    {
        A.get_int(i+1,x);
        Bnode *u = new Bnode;
        u->data = x;
        u->lchild = NULL;
        u->rchild = NULL;
        Name_Number_insert(Tree,u);
        i++;
    }
    cout<<"二叉排序树构造完毕!"<<endl;
}

/*
*查找同名的所有人 关键字(姓名+学号)
*/
void Name_Num_inorder(Bnode *Tree,string x)
{
    if(Tree!=NULL)
    {
        Name_Num_inorder(Tree->lchild,x);
        if (Tree->data.Name == x)
        {
            cout<<"姓名:"<<Tree->data.Name<<" 学号:"<<Tree->data.Number<<" 房号:"<<Tree->data.Room_Num<<endl;
        }
        Name_Num_inorder(Tree->rchild,x);
    }
}

//---------------------关键字(姓名+学号)-------------------


/*
*中序输出
*/
void inorder(Bnode *Tree)
{
    if(Tree!=NULL)
    {
        inorder(Tree->lchild);
        cout<<"房号:"<<Tree->data.Room_Num <<" 学号:"<<Tree->data.Number<<" 姓名:"<<Tree->data.Name<<endl;
        inorder(Tree->rchild);
    }
}


int main()
{

    Bnode *Room_Number_Tree =new Bnode;
    Bnode *Name_Number_Tree =new Bnode;
    list A;
    int room,select;
    string name;
    bool flags = true;
    while(flags)
    {
        cout<<" ------------------菜单---------------------\n";
        cout<<"|-----1:输入数据----------------------------|\n";
        cout<<"|-----2:建立二叉排序树(房号+学号)-----------|\n";
        cout<<"|-----3:输入房号查找同房号所有人------------|\n";
        cout<<"|-----4:建立二叉排序树(姓名+学号)-----------|\n";
        cout<<"|-----5:输入姓名查找同名的所有人------------|\n";
        cout<<"|-----6:二叉排序树中序输出------------------|\n";
        cout<<" -------------------------------------------\n";
        cout<<"提示:"<<endl;
        cout<<"      1.数据只需输入一遍即可\n";
        cout<<"      2.二叉排序树建立一遍即可\n";
        cout<<"      3.顺序:输入数据，建立二叉排序树，再查找\n";
        cout<<" -------------------------------------------\n";
        cout<<"请选择菜单:";
        cin>>select;
        while(select!=1&&select!=2&&select!=3&&select!=4&&select!=5&&select!=6)
        {
            cout<<"输入有误，请输入1|2|3|4|5|6:";
            cin>>select;
        }
        switch(select)
        {
        case 1:
            A.create();
            break;
        case 2:
            RoomNum_Number_Create_bst(A,Room_Number_Tree);//创建二叉排序树  关键字(房号+学号)
            break;
        case 3:
            cout<<"输入房间号:";
            cin>>room;
            Room_Num_inorder(Room_Number_Tree,room);
            break;
        case 4:
            Name_Number_Create_bst(A,Name_Number_Tree);//创建二叉排序树  关键字(姓名+学号)
            break;
        case 5:
            cout<<"输入姓名:";
            cin>>name;
            Name_Num_inorder(Name_Number_Tree,name);
            break;
        case 6:
            cout<<" ------------查看(中序输出)-----------\n";
            cout<<"|-----1:二叉排序树(房号+学号)--------|\n";
            cout<<"|-----0:二叉排序树(姓名+学号)--------|\n";
            cout<<" ------------------------------------\n";
            cout<<"请选择:";
            cin>>select;
            while(select!=1&&select!=0)
            {
                cout<<"输入有误，请输入0|1:";
                cin>>select;
            }
            if(select==1) inorder(Room_Number_Tree);
            else inorder(Name_Number_Tree);
            break;
        }
        cout<<"\n1:返回菜单,0:退出  :";
        cin>>select;
        while(select!=1&&select!=0)
        {
            cout<<"输入有误，请输入0|1:";
            cin>>select;
        }
        if(select==0)flags = false;
    }
    return 0;
}