二叉树的遍历

树的遍历

#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>

using namespace std;

const int N = 35;

int a[N], b[N], p[N];
int n;
vector<int> level[N];

void build(int al, int ar, int bl, int br, int d)
{
    if(al > ar) return ;
    int val = a[ar];
    level[d].push_back(val);
    int k = p[val];
    build(al, al + k - 1 - bl, bl, k - 1, d + 1);
    build(al + k - bl ,ar - 1, k + 1, br, d + 1);
}

int main()
{
    cin >> n;
    for(int i = 0; i < n; i ++)
        cin >> a[i];
    for(int i = 0; i < n; i ++)
        cin >> b[i];
    
    for(int i = 0; i < n; i ++)
        p[b[i]] = i; //中序遍历的位置
    
    build(0, n - 1, 0, n - 1, 0);
    
    for(int i = 0; i < n; i ++)
        for(auto x : level[i])
            cout << x <<" ";
    
    return 0;
}

前 + 中
二叉树的遍历