C语言二叉树的建立与遍历方法

2023-06-20 18:51

短信预约 -IT技能 免费直播动态提醒

本篇内容介绍了“C语言二叉树的建立与遍历方法”的有关知识，在实际案例的操作过程中，不少人都会遇到这样的困境，接下来就让小编带领大家学习一下如何处理这些情况吧！希望大家仔细阅读，能够学有所成！

这里给一个样例树：

C语言二叉树的建立与遍历方法

代码：

#include <stdio.h> #include <string.h>#include <stdlib.h>typedef struct BiTNode{    char data;    struct BiTNode *lchild,*rchild;}BiTNode,*BiTree;BiTree T=NULL;void Create (BiTree *T)       //    二级指针改变地址的地址{    char ch;    scanf("%c",&ch);    if(ch=='#')        *T=NULL;    else    {        *T=(BiTree)malloc(sizeof(BiTNode));        if(!*T)            return ;        else        {            (*T)->data=ch;            Create(&(*T)->lchild);            Create(&(*T)->rchild);        }    }}void PreOrderTraverse(BiTree T){    if(T==NULL)        return ;    printf("%c ",T->data);    PreOrderTraverse(T->lchild);    PreOrderTraverse(T->rchild);}void InOrderTraverse(BiTree T){    if(T==NULL)        return ;    InOrderTraverse(T->lchild);    printf("%c ",T->data);    InOrderTraverse(T->rchild);}void PostOrderTraverse(BiTree T){    if(T==NULL)        return ;    PostOrderTraverse(T->lchild);    PostOrderTraverse(T->rchild);    printf("%c ",T->data);}int main(){    printf("请按先序遍历的结果输入树，例如：ABDH#K###E##CFI###G#J##\n");    Create(&T);    printf("先序遍历的结果为：\n");    PreOrderTraverse(T);    printf("\n");    printf("中序遍历的结果为：\n");    InOrderTraverse(T);    printf("\n");    printf("后序遍历的结果为：\n");    PostOrderTraverse(T);    printf("\n");    return 0;}

输出结果如下

C语言二叉树的建立与遍历方法

PS：下面是一个用C++里面的取引用代替了二级指针

#include<bits/stdc++.h>using namespace std;typedef struct BiTNode{    char data;    struct BiTNode *lchild,*rchild;}BiTNode,*BiTree;BiTree T=NULL;void Create (BiTree &T)        //    C++取引用{    char ch;    scanf("%c",&ch);    if(ch=='#')        T=NULL;    else    {        T=(BiTree)malloc(sizeof(BiTNode));        if(!T)            return ;        else        {            T->data=ch;            Create(T->lchild);            Create(T->rchild);        }    }}void PreOrderTraverse(BiTree T){    if(T==NULL)        return ;    printf("%c ",T->data);    PreOrderTraverse(T->lchild);    PreOrderTraverse(T->rchild);}void InOrderTraverse(BiTree T){    if(T==NULL)        return ;    InOrderTraverse(T->lchild);    printf("%c ",T->data);    InOrderTraverse(T->rchild);}void PostOrderTraverse(BiTree T){    if(T==NULL)        return ;    PostOrderTraverse(T->lchild);    PostOrderTraverse(T->rchild);    printf("%c ",T->data);}int main(){    printf("请按先序遍历的结果输入树，例如：ABDH#K###E##CFI###G#J##\n");    Create(T);    printf("先序遍历的结果为：\n");    PreOrderTraverse(T);    printf("\n");    printf("中序遍历的结果为：\n");    InOrderTraverse(T);    printf("\n");    printf("后序遍历的结果为：\n");    PostOrderTraverse(T);    printf("\n");    return 0;}

PS:遍历的PLus版，想要的自取。

#include <iostream>#include <queue>#include <stack>#include <cstdio>#include <cstdlib>using namespace std;const int cmax=1e2+5;typedef struct BiTNode {char data;struct BiTNode *lchild ,*rchild;}BiTNode,*BiTree;void CreateBiTree (BiTree &T){char ch;scanf("%c",&ch);if(ch=='#')T=NULL;else{T=(BiTNode *)malloc(sizeof(BiTNode));T->data=ch;CreateBiTree(T->lchild);CreateBiTree(T->rchild);}return ; }void PreOrder(BiTree T){if(T){printf("%c",T->data);PreOrder(T->lchild);PreOrder(T->rchild);}}void InOrder(BiTree T){if(T){InOrder(T->lchild);printf("%c",T->data);InOrder(T->rchild);}}void PostOrder(BiTree T){if(T){PostOrder(T->lchild);PostOrder(T->rchild);printf("%c",T->data);}}//   非递归中序遍历 void InOrderTraverse(BiTree T) {stack<BiTree> S;BiTree p;S.push(T);while(!S.empty()){p=new BiTNode;while((p=S.top())&&p)    S.push(p->lchild);S.pop();if(!S.empty()){p=S.top();S.pop();cout<<p->data<<"  ";S.push(p->rchild);  }  } }//    先序非递归遍历void PreOrder_Nonrecursive(BiTree T){stack<BiTree> S;BiTree p;S.push(T);while(!S.empty()){while((p=S.top())&&p){cout<<p->data<<"  ";S.push(p->lchild);  } S.pop();if(!S.empty()){p=S.top();S.pop();S.push(p->rchild); } } }  int visit(BiTree T) { if(T) { printf("%c ",T->data); return 1; }elsereturn 0; } //    非递归层次遍历 void  LeverTraverse(BiTree T) { queue <BiTree> Q; BiTree p; p=T; if(visit(p)==1)     Q.push(p); while(!Q.empty()) { p=Q.front(); Q.pop(); if(visit(p->lchild)==1)     Q.push(p->lchild); if(visit(p->rchild)==1)     Q.push(p->rchild); } }//主函数int main(){BiTree T;char j;int flag=1;printf("本程序实现二叉树的操作。\n");    printf("叶子结点以#表示。\n");    printf("可以进行建立二叉树，递归先序、中序、后序遍历，非递归先序、中序遍历及非递归层序遍历等操作。\n");    printf("请建立二叉树。\n");    printf("建树将以三个空格后回车结束。\n");    printf("例如:1 2 3 4 5 6       (回车)\n\n");CreateBiTree(T);           //初始化队列    getchar();    printf("\n");    printf("请选择: \n");    printf("1.递归先序遍历\n");    printf("2.递归中序遍历\n");    printf("3.递归后序遍历\n");    printf("4.非递归中序遍历\n");    printf("5.非递归先序遍历\n");    printf("6.非递归层序遍历\n");    printf("0.退出程序\n");    while(flag)    {        scanf(" %c",&j);        switch(j)        {            case '1':if(T)            {                printf("递归先序遍历二叉树:");                PreOrder(T);                printf("\n");            }            else printf("二叉树为空!\n");            break;            case '2':if(T)            {                printf("递归中序遍历二叉树:");                InOrder(T);                printf("\n");            }            else printf("二叉树为空!\n");            break;            case '3':if(T)            {                printf("递归后序遍历二叉树:");                PostOrder(T);                printf("\n");            }            else printf("二叉树为空!\n");            break;            case '4':if(T)            {                printf("非递归中序遍历二叉树:");                InOrderTraverse(T);                printf("\n");            }            else printf("二叉树为空!\n");            break;            case '5':if(T)            {                printf("非递归先序遍历二叉树:");                PreOrder_Nonrecursive(T);                printf("\n");            }            else printf("二叉树为空!\n");            break;            case '6':if(T)            {                printf("非递归层序遍历二叉树:");                LeverTraverse(T);                printf("\n");            }            else printf("二叉树为空!\n");            break;            default:flag=0;printf("程序运行结束，按任意键退出!\n");        }    }}

C语言二叉树的建立与遍历方法