C语言实现二叉树的重建源码

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

#define MAX_TREE_NODE  100

typedef struct Node
{
struct Node *left,*right;
char value;
}NODE;

void ReBuild(char *PreOrder,char *InOrder,int TreeLen,NODE **root)
{
int templen = 0;
int leftlen = 0;
int rightlen = 0;
NODE *temp;
temp = (NODE *)malloc(sizeof(NODE));
char *LeftEnd = InOrder;
char *OrgOrder = InOrder;
if(PreOrder == NULL || InOrder == NULL)
{
return;
}
temp->value = *PreOrder;
temp->left = NULL;
temp->right = NULL;
if(*root == NULL)
{