程序出错啦。。。求解

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <fstream>
#include <iostream.h>
#include <malloc.h>
#define MaxSize 100
using namespace std;
typedef char ElemType;
typedef struct node
{
ElemType data;
struct node * lchild;
struct node * rchild;
}BTNode;
extern void CreateBTNode(BTNode * &b,char * str);
extern void DispBTNode (BTNode * b);
extern void DestroyBTNode(BTNode * &b);
void PreOrder(BTNode * b)
{
if(b!=NULL)
{
cout<<b->data ;
PreOrder(b->lchild );
PreOrder(b->rchild );
}
}
void PreOrder1(BTNode * b)
{
BTNode * St[MaxSize],* p;
int top=-1;
if(b!=NULL)
{
top++;
St[top]=b;
while(top>-1)
{
p=St[top];top--;
cout<<p->data ;
if(p->rchild !=NULL)
{
top++;
St[top]=p->rchild ;
}
if(p->lchild !=NULL)
{
top++;
St[top]=p->lchild ;
}
}
cout<<endl;
}
}
void InOrder(BTNode * b)
{
if(b!=NULL)
{
InOrder(b->lchild );
cout<<b->data ;
InOrder(b->rchild );
}
}
void InOrder1(BTNode * b)
{
BTNode * St[MaxSize],*p;
int top=-1;
if(b!=NULL)
{
p=b;
while(top>-1||p!=NULL)
{
while(p!=NULL)
{
top++;
St[top]=p;
p=p->lchild ;
}
if(top>-1)
{
p=St[top];
top--;
cout<<p->rchild ;
}
}
cout<<endl;
}
}
void PostOrder(BTNode * b)
{
if(b!=NULL)
{
PostOrder(b->lchild);
PostOrder(b->rchild );
cout<<b->data ;
}
}
void PostOrder1(BTNode * b)
{
BTNode * St[MaxSize];
BTNode * p;
int flag,top=-1;
if(b!=NULL)
{
do
{
while(b!=NULL)
{
top++;
St[top]=b;
b=b->lchild ;
}
p=NULL;
flag=1;
while(top!=-1&&flag)
{
b=St[top];
if(b->rchild ==p)
{
cout<<b->data ;
top--;
p=b;
}
else
{
b=b->rchild ;
flag=0;
}
}
}while(top!=-1);
cout<<endl;
}
}
void TravLevel(BTNode * b)
{
BTNode * Qu[MaxSize];
int front,rear;
front=rear=0;
if(b!=NULL)
cout<<b->data ;
rear++;
Qu[rear]=b;
while(rear!=front)
{
front=(front+1)%MaxSize;
b=Qu[front];
if(b->lchild !=NULL)
{
cout<<b->lchild ->data ;
rear=(rear+1)%MaxSize;
Qu[rear]=b->lchild ;
}
if(b->rchild !=NULL)
{
cout<<b->rchild->data ;
rear=(rear+1)%MaxSize;
Qu[rear]=b->rchild ;
}
}
cout<<endl;
}
void main()
{
BTNode * b;
CreateBTNode(b,"A(B(D,E(H(J,K(L,M(,N))))),C(F,G(,I)))");
cout<<"二叉树 b : ";
DispBTNode(b);
cout<<endl;
cout<<"层次遍历序树 : ";
TravLevel(b);
cout<<"先序遍历序列 : "<<endl;
cout<<" 递归算法:" ;
PreOrder(b);
cout<<endl;
cout<<" 非递归算法: ";
PreOrder1(b);
cout<<endl;
cout<<"中序遍历序列 : "<<endl;
cout<<" 递归算法: ";
InOrder(b);
cout<<endl;
cout<<" 非递归算法: ";
InOrder1(b);
cout<<endl;
cout<<"后序遍历序列 : "<<endl;
cout<<" 递归算法: ";
PostOrder(b);
cout<<endl;
cout<<" 非递归算法: ";
PostOrder1( b);
cout<<endl;
DestroyBTNode(b);
}