树的三种遍历

最新推荐文章于 2024-10-10 20:14:35 发布

TimeDims

最新推荐文章于 2024-10-10 20:14:35 发布

阅读量103

点赞数

文章标签：数据结构

本文链接：https://blog.csdn.net/qq_45886135/article/details/129801068

版权

头文件
//
// Created by 23958 on 24/3/2023.
//

#ifndef UNTITLED_FUNCTION_H
#define UNTITLED_FUNCTION_H
#include<stdio.h>
#include<stdlib.h>

#define MaxSize 50;

typedef char BiElemType;

typedef struct BiTNode{
BiElemType c;
struct BiTNode *lchild;
struct BiTNode *rchild;
}BiTNode,*BiTree;

typedef struct tag{
BiTree p;
struct tag *pnext;
}tag_t,*ptag_t;

#endif //UNTITLED_FUNCTION_H

主函数
#include “function.h”

void PreOrder(BiTree p){
if(p!=NULL) {
printf(“%c”, p->c);
PreOrder(p->lchild);
PreOrder(p->rchild);
}
}

void InOrder(BiTree p){
if(p!=NULL){
InOrder(p->lchild);
printf(“%c”,p->c);
InOrder(p->rchild);
}
}

void PostOrder(BiTree p){
if(p!=NULL){
PostOrder(p->lchild);
PostOrder(p->rchild);
printf(“%c”,p->c);
}
}

int main(){ BiTree pnew;
BiTree tree=NULL;
BiElemType c;
ptag_t phead=NULL,ptail=NULL,listpnew=NULL,pcur;
while(scanf(“%c”,&c))
{
if(c==‘\n’){
break;
}
pnew = (BiTree)calloc(1,sizeof (BiTNode));
pnew->c=c;
listpnew = (ptag_t) calloc(1,sizeof (tag_t));
listpnew->p=pnew;
if(treeNULL){
tree=pnew;
phead=listpnew;
ptail=listpnew;
pcur=listpnew;
}else{
ptail->pnext=listpnew;
ptail=listpnew;
if(pcur->p->lchildNULL){
pcur->p->lchild=pnew;
}else if(pcur->p->rchild==NULL){
pcur->p->rchild=pnew;
pcur=pcur->pnext;
}
}
}
printf(“----PreOrder----\n”);
PreOrder(tree);
printf(“\n----InOrder----\n”);
InOrder(tree);
printf(“\n----PostOrder----\n”);
PostOrder(tree);
return 0;
}