二叉树的广义表输出

#include <iostream>
#include <strstream>
#include <stdlib.h>
#include <strstrea.h>
typedef struct btreenode
{
char data;
btreenode*left,*right;
}btreenode,*binode;
void binarytree(binode&t)
{
t=NULL;
}
void creattree(binode &t,char*a)
{
btreenode*s[80];
int top=-1;
t=NULL;
btreenode*p=NULL;
int k;
istrstream ins(a);
char ch;
cout<<"输入字符结点:";
ins>>ch;
while(ch!='@')
{
switch(ch)
{
case '(':top++;s[top]=p;k=1;break;
case ')':top--;break;
case',':top++;k=2;break;
default:p=new btreenode;
p->data=ch;
p->left=p->right=NULL;
cout<<p->data<<" ";
if(t==NULL)t=p;
else
{
if(k==1)s[top]->left=p;
else
s[top]->right=p;
}
}
ins>>ch;
}
}
void traverse(binode&t)
{
if(t!=NULL)
{
cout<<t->data<<"";
traverse(t->left);
traverse(t->right);
}
}
int treedepth(binode&t)
{
if(t==NULL)
return 0;
else
{
int dep1=treedepth(t->left);
int dep2=treedepth(t->right);
if(dep1>dep2)return dep1+1;
else return dep2+1;
}
}
int btreenodes(binode&t)
{
if(t==NULL)return 0;
else
return btreenodes(t->left)+btreenodes(t->right)+1;
}
int btreeleafcount(binode&t)
{
if(t==NULL)return 0;
else if(t->left==NULL&&t->right==NULL)return 1;
else return btreeleafcount(t->left)+btreeleafcount(t->right); }
void printtree(binode&t)
{
if(t==NULL)return;
else
{
cout<<t->data;
if(t->left!=NULL||t->right!=NULL)
{
if(t->left!=NULL)cout<<'(';
printtree(t->left);
if(t->right!=NULL)
cout<<',';
printtree(t->right);
if(t->left!=NULL&&t->right!=NULL)
cout<<')';
}
}
}
void cleartree(binode&t)
{
if(t!=NULL)
{
cleartree(t->left);
cleartree(t->right);
delete t;
t=NULL;
}
}
bool isempty(binode&t)
{
if(t==NULL)return 1;
else return 0;
}
void main()
{
binode t;
char a[80]="(a)(b),c(d),e(f),g(h),i(j),k(l),m(n),o@";
creattree(t,a);
cout<<endl;
cout<<"先序遍历:";
traverse(t);
cout<<endl;
cout<<"树的深度为:"<<treedepth(t)<<endl;
cout<<"树的所有结点数为:"<<btreenodes(t)<<endl;
cout<<"树的所有叶子结点数为:"<<btreeleafcount(t)<<endl;
cout<<"按照二叉树的广义表输出整个二叉树:";
printtree(t);
cout<<endl;
cleartree(t);
if(isempty(t))
cout<<"树已被清空!"<<endl;
}。