1086. Tree Traversals Again 解析

通过栈来创建树。

首节点，单独创建。

然后push了之后，该结点为父节点，再push就是放左孩子里面

pop出的为父节点，在push的时候放在右孩子里面。

#include <iostream>
#include <vector>
#include <string>
#include <stack>

#define null -1

using namespace std;


struct Node {
	int left;
	int right;
	Node() { left = null; right = null; }
};
Node t[35];
int n;
stack <int> s;
int root;
vector <int> ans;


void PostOrder(int root) {
	if (root != null) {
		PostOrder(t[root].left);
		PostOrder(t[root].right);
		ans.push_back(root);
	}
}

int main() {
	cin >> n;

	string op;
	int data;
	int top;
	bool isPush = false, isPop = false;
	for (int i = 1; i <= 2 * n; i++) {
		if (i == 1) { //头结点
			cin >> op >> data;
			root = data;
			s.push(data);
			isPush = true;
			top = data;
		}
		else {
			cin >> op;
			if (op == "Pop") {
				isPush = false;
				isPop = true;
				top = s.top();
				s.pop();
			}
			if (op == "Push" && isPush) {
				cin >> t[top].left;
				s.push(t[top].left);
				top = t[top].left;
			}
			else if (op == "Push" && isPop) {
				cin >> t[top].right;
				s.push(t[top].right);
				isPop = false;
				isPush = true;
				top = t[top].right;
			}
		}
	}

	PostOrder(root);

	cout << ans[0];
	for (int i = 1; i < ans.size(); i++) {
		cout << " " << ans[i];
	}
	cout << endl;

	return 0;
}