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

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

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

char Pre[100], In[100];

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

Tree BuildTree(char* Pre, char* In, int n);
void PostOrder(Tree T)