根据后序遍历和中序遍历输出先序遍历

Tsoor_h

于 2020-12-06 12:09:11 发布

阅读量420

点赞数

CC 4.0 BY-SA版权

文章标签： c语言数据结构二叉树

本文链接：https://blog.csdn.net/Tsoor_h/article/details/110732953

该博客详细介绍了如何通过已知的后序遍历和中序遍历序列，利用递归算法来重建二叉树并输出其先序遍历序列。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

根据后序遍历和中序遍历输出先序遍历

#include <stdio.h>
#include <stdlib.h>

char Post[100], In[100];

typedef struct Node {
	char Data;
	struct Node* Left;
	struct Node* Right;
}* Tree;

Tree BuildTree(char* Post, char* In, int n);
void PreOrder(Tree T);

int main()
{
	Tree T = NULL;
	char c;
	int n = 0;

	c = getchar();
	while (c != '\n')
	{
		Post[n++] = c;
		c = getchar();
	}

	n = 0;
	c = getchar();
	while (c != '\n')
	{
		In[n++] = c;
		c = getchar();
	}

	T = BuildTree(Post, In, n);
	printf("PreOrder:");
	PreOrder(T);

	return 0;
}

Tree BuildTree(char* Post, char* In, int n)
{
	if (!n)
		return NULL;

	char* mid = In;
	while (*mid != *(Post + n - 1))
		mid++;

	Tree T = (Tree)malloc(sizeof(struct Node));
	T->Data = *mid;
	T->Left = BuildTree(Post, In, mid - In);
	T->Right = BuildTree(Post + (mid - In), mid + 1, n - (mid - In) - 1);

	return T;
}

void PreOrder(Tree T)
{
	if (T)
	{
		printf(" %c", T->Data);
		PreOrder(T->Left);
		PreOrder(T->Right);
	}
}