프로그래밍의 아름다움 재건 두 갈래 나무

#include<iostream>
using namespace std;

/*
 *authored  by Shishuai
 *Time 2014/3/21
 *program： 
 */
 typedef struct NODE
 {
    struct NODE *pLeft;
    struct NODE *pRight;
    char chValue;
 }Node,*pNode;
char pPreOrder[6]= {'a','b','d','c','e','f'};
char pInOrder[6] = {'d','b','a','e','c','f'};
pNode Rebuild(char *pPreOrder,char *pInOrder,int nTreeLength);
int FindPostion(char value,char *pInOrder,int nTreeLength);
void Print(pNode Ptree);
int main()
{
    pNode pTree=Rebuild(pPreOrder,pInOrder,6);
    Print(pTree);
    return 0;
}
pNode Rebuild(char *pPreOrder,char *pInOrder,int nTreeLength)
{
    if(0==nTreeLength)
        return NULL;
    int pPos=FindPostion(pPreOrder[0],pInOrder,nTreeLength);
    pNode ret=(pNode)malloc(sizeof(Node));
    ret->chValue=pPreOrder[0];
    ret->pLeft = Rebuild(pPreOrder+1,pInOrder,pPos);
    ret->pRight= Rebuild(pPreOrder+pPos+1,pInOrder+pPos+1,nTreeLength-pPos-1);
    return ret;
}
int FindPostion(char value,char *pInOrder,int nTreeLength)
{
    int i=0;
    for(;i<nTreeLength;i++)
    {
        if(pInOrder[i]==value)
            return i;
    }
    return -1;
}
void Print(pNode Ptree)
{
    if(NULL==Ptree)
        return;
    cout<<Ptree->chValue;
    if(NULL!=Ptree->pLeft)
    cout<<" left "<<Ptree->pLeft->chValue;
    if(NULL!=Ptree->pRight)
    cout<<" right "<<Ptree->pRight->chValue;
    cout<<endl;
    Print(Ptree->pLeft);
    Print(Ptree->pRight);


}