编程之美3.9 重建二叉树

struct NODE{
NODE* pLeft;
NODE* pRight;
char chValue;
};

bool Rebuild(char* pPreOrder,char* pInOrder,int nTreeLen,NODE** pRoot)
{
if(nTreeLen==0)
{
*pRoot=NULL;
return true;
}

*pRoot=new NODE();
(*pRoot)->chValue=pPreOrder[0];

int parentIndexIn=0;
for(int i=0;i<nTreeLen;i++)
{
if (pPreOrder[0]==pInOrder[i])
{
parentIndexIn=i;
if(Rebuild(&pPreOrder[1],pInOrder,parentIndexIn,&((*pRoot)->pLeft))
&&Rebuild(&pPreOrder[parentIndexIn+1],&pInOrder[parentIndexIn+1],nTreeLen-parentIndexIn-1,&((*pRoot)->pRight)))
return true;
}
}
return false;

}

int main()
{
char* preOrder="abdccf";
char* inOrder="dbaccf";
NODE** pRoot=new NODE*;
Rebuild(preOrder,inOrder,6,pRoot);
return 0;
}