**二叉树的遍历以及建树方法
#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
char pre[N],mid[N],post[N];
void postorder(node *root)
{
if(root!=NULL)
{
postorder(root->lson);
postorder(root->rson);
cout<<root->data;
}
} //后序遍历
void midorder(node *root)
{
if(root!=NULL)
{
midorder(root->lson);
cout<<root->data;
midorder(root->rson);
}
} //中序遍历
void preorfer(node *root)
{
if(root!=NULL)
{
cout<<root->data;
midorder(root->lson);
midorder(root->rson);
}
} //先序遍历
void cengci(struct node * root)
{
struct node * temp[100];
int in = 0, out = 0;
while(in > out)
{
if(temp[out])
{
cout << temp[out]->data;
temp[in++] = temp[out]->lson;
temp[in++] = temp[out]->rson;
}
out++;
}
} //层序遍历
//已经知道先序和中序进行建树
node *buildtree(int len,char pre[],char mid[])
{
node *root;
if(!len)
{
return NULL;
}
root=new node;
root->data=pre[0];
int i;
for(i=0;i<len;i++)
{
if(mid[i]==pre[0])
break;
}
root->lson=buildtree(i,pre+1,mid);
root->rson=buildtree(len-i-1,pre+1+i,mid+i+1);
return root;
}
//已经知道后序和中序进行建树
node *builtree(int len,char mid[],char post[])
{
node *root;
root=new node;
if(!len)
return NULL;
root->data=post[len-1];
int i;
for(i=0;i<len;i++)
if(mid[i]==post[len-1])
break;
root->lson=builtree(i,mid,post);
root->rson=builtree(len-i-1,mid+i+1,post+i);
return root;
}