L2-006. 树的遍历

L2-006. 树的遍历

树的遍历递归实现。。。。

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int const MAX = 505;
int const INF = 0x3fffffff;
int be[MAX], mi[MAX];

struct node{
    int l, r;
}a[MAX];


int build(int la, int ra, int lb, int rb) { //la, ra表示中序遍历，lb， rb表示后序遍历；
    if(la > ra) return 0;
    int rt = be[rb], p1, p2;
    p1 = la;
    while(mi[p1] != rt) p1++;
    p2 = p1 - la;
    a[rt].l = build(la, p1 - 1, lb, lb + p2 - 1);
    a[rt].r = build(p1 + 1, ra, lb + p2, rb - 1);
    return rt;
}

void bfs(int x) //层次遍历；
{
    queue<int>q;
    vector<int>v;
    q.push(x);
    while(!q.empty()){
        int w = q.front();
        q.pop();
        if(w == 0) break;
        v.push_back(w);
        if(a[w].l != 0)  q.push(a[w].l);
        if(a[w].r != 0)  q.push(a[w].r);
    }
    int len = v.size();
    cout << v[0] ;
    for(int i = 1; i < len; i++) {
        cout << " " << v[i];
    }
    cout << endl;
}


int main()
{
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; i++) scanf("%d", &be[i]);
    for(int i = 0; i < n; i++) scanf("%d", &mi[i]);
    build(0, n-1, 0, n-1);
    int root = be[n - 1];
    bfs(root);
    return 0;
}