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

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

#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);