重建二叉树Tree Recovery

Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.

This is an example of one of her creations:

         D
        / \
       /   \
      B     E
     / \     \
    /   \     \
   A     C     G
              /
             /
            F

To record her trees for future generations, she wrote down two strings for each tree: a preorder traversal (root, left subtree, right subtree) and an inorder traversal (left subtree, root, right subtree). For the tree drawn above the preorder traversal is DBACEGF and the inorder traversal is ABCDEFG.

She thought that such a pair of strings would give enough information to reconstruct the tree later (but she never tried it).

Now, years later, looking again at the strings, she realized that reconstructing the trees was indeed possible, but only because she never had used the same letter twice in the same tree.

However, doing the reconstruction by hand, soon turned out to be tedious.

So now she asks you to write a program that does the job for her!
Input

The input will contain one or more test cases.

Each test case consists of one line containing two strings preord and inord, representing the preorder traversal and inorder traversal of a binary tree. Both strings consist of unique capital letters. (Thus they are not longer than 26 characters.)

Input is terminated by end of file.
Output
For each test case, recover Valentine's binary tree and print one line containing the tree's postorder traversal (left subtree, right subtree, root).
Sample Input

DBACEGF ABCDEFG
BCAD CBAD
Sample Output
ACBFGED
CDAB

#include <stdio.h>//程序来自DiaoCow
#include <stdlib.h>
#include <string.h>

typedef struct Node
{
    char    chValue;
    struct Node    *lChild;
    struct Node    *rChild;
}Node;

//重建二叉树
void Rebuild(char *pPreOrder , char *pInOrder , Node **pRoot , int nTreeLen)
{
    int  nLeftLen , nRightLen;
    char *pLeftEnd;
    Node *p;

    //边界条件检查
    if(!pPreOrder || !pInOrder || !pRoot)    return;   

    if(!(p = (Node *)malloc(sizeof(Node))))    return;
    p->chValue = *pPreOrder;    
    p->lChild = p->rChild = NULL;
    *pRoot = p;
    
    if(nTreeLen == 1)    return;

    //划分左右子树
    pLeftEnd = pInOrder;
    while(*pLeftEnd != *pPreOrder)    pLeftEnd++;//在中序序列中找到根的位置，根的左右分别是左右子树
    nLeftLen = (int)(pLeftEnd - pInOrder);//计算左右子树序列的长度
    nRightLen = nTreeLen - nLeftLen - 1;

    if(nLeftLen)    Rebuild(pPreOrder + 1 , pInOrder , &(p->lChild) , nLeftLen);
    if(nRightLen)   Rebuild(pPreOrder + nLeftLen + 1, pInOrder + nLeftLen + 1 , &(p->rChild) , nRightLen);
}

//后序遍历
void PostOrder(Node *p)
{
    if(p)
    {
        PostOrder(p->lChild);
        PostOrder(p->rChild);
        printf("%c",p->chValue);
    }
}

int main(void)
{
    char PreOrder[32] , InOrder[32];
    Node *pTree;
    printf("依次输入先序和中序序列：");
    //输入先序和中序序列
    while(scanf("%s%s", PreOrder , InOrder) != EOF)
    {
        Rebuild(PreOrder , InOrder , &pTree , strlen(PreOrder));
        PostOrder(pTree);
        printf("\n");
    }
    return 0;
}