Submission #535213

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

#define int long long

struct Vertex
{
	char c;
	Vertex *p[2];
	Vertex(char _c)
	{
		c = _c;
		p[0] = p[1] = NULL;
	}
};

Vertex *root;

void ILikeTree(string A)
{
	stack<Vertex*> s;
	for (int i = 0; i < A.size(); i++)
	{
		Vertex *v = new Vertex(A[i]);
		if (!isdigit(A[i]))
		{
			v = new Vertex(A[i]);
			v->p[0] = s.top(); s.pop();
			v->p[1] = s.top(); s.pop();
		}
		s.push(v);
		if (i == A.size() - 1) root = v;
	}
}

string Solve()
{
	string B;
	queue<Vertex*> q;
	q.push(root);
	while (!q.empty())
	{
		Vertex* v = q.front(); q.pop();
		B.push_back(v->c);
		if (v->p[0] == NULL) continue;
		q.push(v->p[1]); q.push(v->p[0]);
	}
	reverse(B.begin(), B.end());
	return B;
}

signed main()
{
	string A;
	cin >> A;
	ILikeTree(A);
	cout << Solve() << endl;
	return 0;
}

Submission Info

Judge Result