树-前序中序求后序

最新推荐文章于 2023-02-17 12:56:49 发布

这是小卢呀

最新推荐文章于 2023-02-17 12:56:49 发布

阅读量121

点赞数

本文链接：https://blog.csdn.net/qq_41581913/article/details/104476678

版权

已知前序中序求后序

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

void post(char * pre, char * in, int len){
	char ch;
	if(len == 0) return;
	ch = * pre;
	int i;
	for(i = 0; i < len; i++){
		if(in[i] == *pre) break;
	}
	post(pre + 1, in, i);
	post(pre + 1 + i, in + i + 1, len - i - 1);
	cout << ch << " ";
}


int main(){
	char pre[8] = {'G','D','A','F','E','M','H','Z'};
	char in[8] = {'A','D','E','F','G','H','M','Z'};
	post(pre,in, 8);
	return 0;
}