【编程之美】3.9已知先序和中序遍历，求后序遍历+POJ-2255

最新推荐文章于 2019-03-27 18:28:40 发布

famousDT

最新推荐文章于 2019-03-27 18:28:40 发布

阅读量1.2k

点赞数

分类专栏：数据结构文章标签：编程 tree struct null

本文链接：https://blog.csdn.net/famousDT/article/details/7385920

版权

数据结构专栏收录该内容

31 篇文章 0 订阅

订阅专栏

很久以前写过，现在把我的递归版本代码贴出

struct tree
{
	char c;
	struct tree * left_child;
	struct tree * right_child;
} * root;
tree * create_tree(char pre[], char in[], int len)
{
	if (len == 0) return NULL;
	tree * t = new tree;
	t->c = pre[0];
	int i;
	for (i = 0; i < len; ++i)
		if (in[i] == pre[0])
			break;
	int j;
	t->left_child = create_tree(pre + 1, in, i);
	t->right_child = create_tree(pre + i + 1, in + i + 1, len - i - 1);
	return t;
}
void print(tree * t) {
	if (t == NULL) return ;
	print(t->left_child);	
	print(t->right_child);
	cout<<t->c;
}
int main()
{
	char pre[30], in[30];
	root = new tree;
	while (scanf("%s%s", pre, in) == 2) {
		root = create_tree(pre, in, strlen(pre));
		print(root);
		printf("\n");
	}
    return 0;
}