树的递归遍历和非递归遍历

#include <stdio.h>
#include <malloc.h>


typedef struct Binode
{
char data;
struct Binode *lchild,*rchild;
}Binode,*Bitree;




void creat(Bitree &T)
{

char ch;
scanf("%c",&ch);
if(ch==' '){T=NULL;}
else
{
T=(Bitree)malloc(sizeof(Binode));
T->data=ch;
creat(T->lchild);
creat(T->rchild);
}
}


void preorder(Bitree &T)
{
if(T!=NULL)
{
printf("%c ",T->data);
preorder(T->lchild);
preorder(T->rchild);
}
}




void inorder(Bitree &T)
{
if(T!=NULL)
{
inorder(T->lchild);
printf("%c ",T->data);
inorder(T->rchild);
}
}


void outorder(Bitree &T)
{
if(T!=NULL)
{
outorder(T->lchild);
outorder(T->rchild);
printf("%c ",T->data);
}
}


void preorder1(Bitree &T)
{
Bitree stack[100];
Bitree p=T;
int top=0;
while(p!=NULL||top>0)
{
 if(p!=NULL)
 {
printf("%c ",p->data);
stack[top++]=p;
p=p->lchild;
 }
 else
 {
 p=stack[--top];
 p=p->rchild;
 }
}
}


void inorder1(Bitree &T)
{
Bitree stack[100];
Bitree p=T;
int top=0;
while(p!=NULL||top>0)
{
 if(p!=NULL)
 {


stack[top++]=p;
p=p->lchild;
 }
 else
 {
 p=stack[--top];
  printf("%c ",p->data);
 p=p->rchild;
 }
}
}


void main()
{
Bitree T;
T=NULL;
creat(T);
printf("The preorder is:\n");
preorder(T);
printf("\nThe preorder1 is:\n");
preorder1(T);
printf("\nThe inorder is:\n");
inorder(T);
printf("\n");
printf("The inorder is:\n");
inorder1(T);
printf("\n");
printf("The outorder is:\n");
outorder(T);
printf("\n");


}