已知层次遍历和中序遍历求二叉树_pat 1020 Tree Traversals已知后序和中序求层序遍历（二叉树）...

好久没写二叉树遍历的相关东西，差点忘掉怎么写，特地记录一下：

重建二叉树的函数分别用两种方法实现了一下

详见代码：

#include

using namespace std;

typedef long long LL;

const int inf = 0x3f3f3f3f;

#define mp make_pair

#define pb push_back

#define fi first

#define se second

typedef struct Tree{

int num;

struct Tree *left;

struct Tree *right;

}Tree;

int a[35];

int b[35];

int n;

//p代表后序遍历的最后，q代表中序遍历的起点，

//len代表子树的长度

/*Tree* build(int p,int q,int len)

{

//cout << p << " " << q << " " << len << endl;

if(len == 0)

return NULL;

if(len == 1){

Tree* node = (Tree *)malloc(sizeof(Tree));

node -> num = b[q];

node -> left = NULL;

node -> right = NULL;

return node;

}

int root = q;

for(int i = q;i <= n;++i){

if(a[p] == b[i]){

root = i;

break;

}

}

Tree* node = (Tree *)malloc(sizeof(Tree));

node -> num = b[root];

node -> right = build(p - 1,root + 1,q + len - root - 1);

node -> left = build(p - q - len + root,q,root - q);

return node;

}*/

//这个是分别存放每个子树对应后序，中序的边界

//这个更简便点

Tree* build(int Lpost,int Rpost,int Lin,int Rin)

{

int Lnum,Rnum;

int mid;

for(int i = Lin;i <= Rin;++i){

if(b[i] == a[Rpost]){

Lnum = i - Lin;

Rnum = Rin - i;

mid = i;

break;

}

}

Tree* node = (Tree *)malloc(sizeof(Tree));

node -> num = a[Rpost];

if(Lnum){

node -> left = build(Lpost,Rpost - Rnum - 1,Lin,mid - 1);

}else{

node -> left = NULL;

}

if(Rnum){

node -> right = build(Rpost - Rnum,Rpost - 1,mid + 1,Rin);

}else{

node ->right = NULL;

}

return node;

}

int main()

{

Tree *root;

cin >> n;

for(int i = 1;i <= n;++i)

cin >> a[i];

for(int i = 1;i <= n;++i)

cin >> b[i];

root = build(1,n,1,n);

vectorve;

queueque;

que.push(root);

while(!que.empty())

{

Tree* tmp = que.front();

que.pop();

ve.pb(tmp -> num);

if(tmp -> left != NULL){

que.push(tmp -> left);

}

if(tmp -> right != NULL){

que.push(tmp -> right);

}

}

for(int i = 0;i < ve.size();++i){

if(i == ve.size() - 1){

printf("%d\n",ve[i]);

}else{

printf("%d ",ve[i]);

}

}

return 0;

}