数据结构

#include
#include
using namespace std;
struct Node
{
string data;
Node* rchild;
Node* lchild;
int index;
Node():data(""),rchild(nullptr),lchild(nullptr),index(0){}
};
struct Node_static
{
string data;
int lchild;
int rchild;
int index;
Node_static():data(""),lchild(-1),rchild(-1){}
};
static int i=0;
Node* CreateTree() //先序创建动态二叉链表
{
Nodetree;
string str;
cin>>str;
if(str=="#")
tree=nullptr;
else
{
tree=new Node;
tree->data=str;
tree->index=i++;
//cout<<“这一步你的输入将被存储在左孩子\n”;
tree->lchild=CreateTree();
//ibcout<<“这一步你的输入将被存储在右孩子\n”;
tree->rchild=CreateTree();
}
return tree;
}
static int j=0;
void exchange(Node tree,Node_static a[]) //中序遍历转静态二叉链表
{
if(tree->lchild!=nullptr) exchange(tree->lchild,&a[0]);
a[j].data=tree->data;
a[j].index=tree->index;
if(tree->lchildnullptr)
a[j].lchild=-1;
else a[j].lchild=tree->lchild->index;
if(tree->rchildnullptr)
a[j].rchild=-1;
else a[j].rchild=tree->rchild->index;
j++;
if(tree->rchild!=nullptr) exchange(tree->rchild,&a[0]);
}
void PreOrder(Node* t) //先序遍历
{
if(t)
{
cout<data<<"\n";
PreOrder(t->lchild);
PreOrder(t->rchild);
}
}
void InOrder(Node* t) //中序遍历
{
if(t)
{
InOrder(t->lchild);
cout<data<<"\n";
InOrder(t->rchild);
}
}
int main()
{
Node*t=CreateTree();
cout<<endl;
Node_static a[20];
cout<<“中序遍历的结果为：”<<endl;
InOrder(t);
cout<<endl;
exchange(t,a);
printf(“i\tdata\tlchild\trchild\t\n”);
for(int m=0;m<i;m++)
{
cout<<a[m].index<<"\t"<<a[m].data<<"\t"<<a[m].lchild<<"\t"<<a[m].rchild<<"\n";
}
}//数据在紫皮书129页