C++字母二叉树的前,中,后序输入输出
数据结构的二叉树的输入与输出,直接上代码!!
先创建树的结构体C++
typedef struct BTree{
BTree*left;
BTree*right;
char data;
}*Tree;//创建二叉树结构体
```cpp
**创建二叉树**
void CreateBTree(Tree &T)
{
T=new BTree;
char s;
cin>>s;
if(s=='~')
T=NULL;
else
{
T->data=s;
CreateBTree(T->left);
CreateBTree(T->right);
}
}//给二叉树进行输入
**创建二叉树**
void CreateBTree(Tree &T)
{
T=new BTree;
char s;
cin>>s;
if(s=='~')
T=NULL;
else
{
T->data=s;
CreateBTree(T->left);
CreateBTree(T->right);
}
}//给二叉树进行输入
**先序遍历**
void PreorderBTree(Tree T)
{
if(T)
{
cout<<T->data<<" ";
PreorderBTree(T->left);
PreorderBTree(T->right);
}
}
**中序**
void MiddleorderBTree(Tree T)
{
if(T)
{
MiddleorderBTree(T->left);
cout<<T->data<<" ";
MiddleorderBTree(T->right);
}
}//先左后右中间输出
**后序**
void PostscriptBTree(Tree T)
{
if(T)
{
PostscriptBTree(T->left);
PostscriptBTree(T->right);
cout<<T->data<<" ";
}
}
在加个主函数就可以运行了·