二叉树链式

include
#include <stdlib.h>
using namespace std;
#define MaxSize 100
typedef struct node
{
char data;
struct node *lchild,*rchild;
}BTNode;
void CreatBTBode(BTNode *&b,char *str)
{
BTNode *St[MaxSize],*p;
int top=-1,k,j=0;
char ch;
b=NULL;
ch=str[j];
while(ch!=’\0’)
{
switch(ch)
{
case’(’:top++;St[top]=p;k=1;break;
case’)’:top–;break;
case’,’:k=2;break;
default:
p=(BTNode *)malloc(sizeof(BTNode));
p->data=ch;p->lchild=p->rchild=NULL;
if(bNULL)
b=p;
else
{
switch(k)
{
case 1:St[top]->lchild=p;break;
case 2:St[top]->rchild=p;break;
}
}
}
j++;ch=str[j];
}
}
void DestroyBT(BTNode *&b)
{
if(bNULL)return;
else
{
DestroyBT(b->lchild);
DestroyBT(b->rchild);
free(b);
}
}
BTNode *FindNode(BTNode *b,char x)
{
BTNode *p;
if(bNULL)return NULL;
else if(b->datax)return b;
else
{
p=FindNode(b->lchild,x);
if(p!=NULL)return p;
else return FindNode(b->rchild,x);
}
}
BTNode *LchildNode(BTNode *p)
{
return p->lchild;
}
BTNode *RchildNode(BTNode *p)
{
return p->rchild;
}
int BTNodeDepth(BTNode *b)
{
int lchilddep=0,rchilddep=0;
if(b==NULL)return 0;
else
{
lchilddep=BTNodeDepth(b->lchild);
rchilddep=BTNodeDepth(b->rchild);
return(lchilddep>rchilddep)?(lchilddep+1):(rchilddep+1);
}
}
void DispBTNode(BTNode *b)
{
if(b!=NULL)
{
cout<data;
if(b->lchild!=NULL||b->rchild!=NULL)
{
cout<<"(";
DispBTNode(b->lchild);
if(b->rchild!=NULL)
cout<<",";
DispBTNode(b->rchild);
cout<<")";
}
}
}
int main()
{
BTNode *b;
char str[MaxSize];
cin>>str;
CreatBTBode(b,str);
DispBTNode(b);
int heigh=BTNodeDepth(b);
cout<<heigh<<endl;
return 0;
}