Парламент

#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define mp make_pair


struct top
{
    int name;
    top* r, *l;
};

top* netop(int name)
{
    top* newtop = new top();
    newtop->name = name;
    newtop->l = NULL;
    newtop->r = NULL;
    return newtop;
}

void addtree(top* cor, int name)
{
    if (cor->name > name)
    {
        if (cor->l == NULL)
        {
            cor->l = netop(name);
        }
        else
            addtree(cor->l, name);
    }
    else
        if (cor->r == NULL)
        {
            cor->r = netop(name);
        }
        else
            addtree(cor->r, name);

}

void writetree(top* coren)
{
    if (coren->r!=NULL)
        writetree(coren->r);
    if (coren->l != NULL)
        writetree(coren->l);
    cout << coren->name << endl;
}
int main()
{
    int n;
    cin >> n;
    int prom;
    stack<int>was;
    for (int i = 1; i <= n; i++)
    {
        cin >> prom;
        was.push(prom);
    }

    prom = was.top();
    was.pop();
    top* coren = netop(prom);
    for (int i = 2; i <= n; i++)
    {
        prom = was.top();
        was.pop();
        addtree(coren, prom);
    }

    writetree(coren);
    system("pause");
    return 0;
}