由二叉樹的前序和中序還原二叉樹

#include <stdio.h>
#include <stdlib.h>
///////////////////////////////////
typedef struct BiTreeNode
{
	char   value;
	struct BiTreeNode* lt;
	struct BiTreeNode* rt;
}BiTreeNode,BiTree;
void InitiateNode(BiTreeNode*&  p)
{
	p->value = '0';
	p->lt = NULL;
	p->rt = NULL;
}
BiTreeNode* BuildTree(char* pre, char* mid, int numOfNode)
{
	if(0 == numOfNode) return NULL;
	BiTreeNode* bt = (BiTreeNode*)malloc(sizeof(BiTreeNode));
	InitiateNode(bt);
	bt->value = pre[0];
	int i;
	for(i = 0; i < numOfNode; i++)
		if(mid[i] == pre[0]) break;
	bt->lt = BuildTree(pre+1, mid, i);
	bt->rt = BuildTree(pre+i+1, mid+i+1, numOfNode-i-1);
	return bt;
}
void Paint(BiTree* root, int n/*"n"爲縮進的層數*/)/////打印
{
	int i;
	if(NULL == root) return;
	Paint(root->rt, n+1);/// 遍歷打印右子樹
	for(i = 0; i < 2*n-1; i++) printf(" ");
	if(n > 0)  printf("--%c\n",root->value);//輸出有效值
	Paint(root->lt, n+1);
}
int main(void)
{
	int size;
	printf("請輸入節點的個數:  ");
	scanf("%d",&size);
	//char pre[size];//前序序列
	//char mid[size];//中序序列
	char* pre; //前序序列
	char* mid;//中序序列
	pre = (char*)malloc(sizeof(char)*size);
	mid = (char*)malloc(sizeof(char)*size);
	printf("請輸入前序序列:  ");
	scanf("%s",pre);
	printf("請輸入中序序列： ");
	scanf("%s",mid);
	printf("%s\n",pre);
	printf("%s\n",mid);
	BiTree* root;
	root = BuildTree(pre, mid, size);
	printf("原二叉樹是：\n");
	Paint(root, 2);//此處的5，只是是爲了打印好看
	printf("\n");
	return 0;
}