1086 Tree Traversals Again （25 分)

最新推荐文章于 2021-02-20 12:42:16 发布

小小怪中式咖啡

最新推荐文章于 2021-02-20 12:42:16 发布

阅读量202

点赞数

分类专栏： PAT 文章标签：甲级

本文链接：https://blog.csdn.net/qq_41755143/article/details/89150017

版权

PAT 专栏收录该内容

107 篇文章 0 订阅

订阅专栏

AC代码:

#include <iostream>
#include <stack>
#include <cstdio>
#include <string>
using namespace std;

const int maxn = 35;
int n;
int post[maxn], in[maxn], pre[maxn];
struct node {
	int data;
	node* lchild;
	node* rchild;
};

//先序和中序，那叫构建树,而非求出后序
node* create(int preL, int preR, int inL, int inR) {
	if (preL > preR)
		return NULL;
	node* root = new node;
	root->data = pre[preL];
	int k;
	for (k = inL; k < inR; k++) {
		if (in[k] == root->data)
			break;
	}
	int numLeft = k - inL;
	root->lchild = create(preL + 1, preL + numLeft, inL, k - 1);
	root->rchild = create(preL + numLeft + 1, preR, k + 1, inR);
	return root;
}

int num = 0;
void postorder(node* root) {
	if (root == NULL)
		return;
	postorder(root->lchild);
	postorder(root->rchild);
	printf("%d", root->data);
	num++;
	if (num < n)
		printf(" ");
}

int main() {
	stack<int> st;
	string str;
	cin >> n;
	int prenum = 0, innum = 0;
	getchar();
	while (getline(cin, str)) {
		if (str[1] == 'u') {//Push
			string nums = str.substr(4);
			int num = atoi(nums.c_str());
			st.push(num);
			pre[prenum++] = num;
		}
		else {//Pop
			int num = st.top();
			st.pop();
			in[innum++] = num;
		}
		if (innum == n)//控制结束循环
			break;
	}
	node* root = create(0, n - 1, 0, n - 1);
	postorder(root);
	/*for (int i = 0; i < prenum; i++) {
		if (i != 0)
			printf(" ");
		printf("%d", pre[i]);
	}

	cout << endl;
	for (int i = 0; i < innum; i++) {
		if (i != 0)
			printf(" ");
		printf("%d", in[i]);
	}
	cout << endl;*/
	return 0;
}

判断Push，Pop函数写得不够简练,