数据库第4天

非递归二叉树

#include<stdio.h>
#include<malloc.h>
typedef struct Node{
    char data;
    struct Node *lchild,*rchild;
}bintree;
typedef struct {//栈结构定义
    bintree* a[100];
    int tag[100];//为栈中每个元素做标记，用于后序遍历
    int top; //栈顶指针
}seqstack;
void push (seqstack* s,bintree *tree){//进栈
    s->a[s->top]=tree;//把元素存在栈中
    s->tag[s->top]=0;
    s->top++;
}
bintree* pop(seqstack*s){//出栈
       s->top--;
        return s->a[s->top];
    }
void initStack(seqstack*s){
   s->top=0;
}
int isEmpty(seqstack *s){
    if( s->top==0) return 1;
    else  return 0;
}
bintree* creat(){
   bintree*tree;
   char x=getchar();
   if(x=='#')   return NULL; //这个函数没有返回类型不能返回NULL
   tree=(bintree*)malloc(sizeof(bintree));
   tree->lchild=NULL; tree->rchild=NULL;
   tree->data=x;
   tree->lchild=creat();
   tree->rchild=creat();
   return tree;
}
void preorder(bintree *tree){
   seqstack s;
   initStack(&s);
   while(tree!=NULL||isEmpty(&s)==0){
   if(tree!=NULL){
    printf("%c ",tree->data);
    push(&s,tree);
    tree=tree->lchild;
    }
    else{
    tree=pop(&s);
    tree=tree->rchild;
    }
   }
}
void inorder(bintree *tree){
   seqstack s;
   initStack(&s);
   while(tree!=NULL||isEmpty(&s)==0){
   if(tree!=NULL){
    push(&s,tree);
    tree=tree->lchild;
    }
    else{
    tree=pop(&s);
    printf("%c ",tree->data);
    tree=tree->rchild;
    }
   }
}
bintree *poptag(seqstack*s){
   return s->a[s->top-1];
}
void tag_(seqstack*s){
  s->tag[s->top-1]=1;
}
int istag(seqstack*s){
  if(s->tag[s->top-1]==1)  return 1;
  else return 0;
}
void postorder(bintree *tree){
   seqstack s;
   initStack(&s);
   while(tree!=NULL||isEmpty(&s)==0){
    if(tree!=NULL){
    push(&s,tree);
    tree=tree->lchild;
    }
    else if(istag(&s)==1){
    tree=pop(&s);
    printf("%c ",tree->data);
    tree=NULL;
    }
    else {
    tree=poptag(&s);
    tag_(&s);
    tree=tree->rchild;
    }
   }
}
main(){
    bintree *tree;
    printf("请输入一组字符建树，#表示NULL:\n");
    tree=creat();
    printf("\n pre  Order is : ");
    preorder(tree);
    printf("\n inorder Order is : ");
    inorder(tree);
    printf("\n postorder Order is : ");
    postorder(tree);
}
//ABD###CE##F##