重建二义树C++实现

#include<iostream>
#include<cstring>
#include<cstdlib>
using namespace std;


int N = 100;
typedef struct BNode {
int value;
BNode *lChild;
BNode *rChild;
} BNode, *BTree;


BTree createBTree(int *preStart, int *preEnd, int *inStart, int *inEnd)
{
if((preStart == NULL) || (preEnd == NULL) || (inStart == NULL) || (inEnd == NULL))
{
return NULL;
}
BNode *rootNode = (BNode*)malloc(sizeof(BNode));
int rootValue = *preStart;
rootNode->value = rootValue;
int *pMid = inStart;
while(*pMid != rootValue) {
++pMid;
}
int leftLen = pMid - inStart;
int rightLen = inEnd - pMid;
if(leftLen <= 0)
{
rootNode->lChild = NULL;
} else {
int *lPreStart = preStart + 1;
int *lPreEnd = lPreStart + leftLen - 1;
int *lInStart = inStart;
int *lInEnd = lInStart + leftLen - 1;
rootNode->lChild = createBTree(lPreStart, lPreEnd, lInStart, lInEnd);
}
if(rightLen <= 0)
{
rootNode->rChild = NULL;
} else {
int *rPreStart = preEnd - rightLen + 1;
int *rPreEnd = preEnd;
int *rInStart = inEnd - rightLen + 1;
int *rInEnd = inEnd;
rootNode->rChild = createBTree(rPreStart, rPreEnd, rInStart, rInEnd);
}
return rootNode;
}


void postPrint(BTree tree)
{
if(tree->lChild != NULL)
{
postPrint(tree->lChild);
}
if(tree->rChild != NULL)
{
postPrint(tree->rChild);
}
cout<<tree->value<<endl;
}


int main()
{
int a[N];
int b[N];
int num, i;
memset(a, 0, N*sizeof(int));
cout<<"Give the num of Nodes: "<<endl;
cin>>num;
cout<<"PreOrder: ";
for(i = 0; i < num; ++i)
{
cin>>a[i];
}
cout<<"InOrder: ";
for(i = 0; i < num; ++i)
{
cin>>b[i];
}
int *preStart = &a[0], *preEnd = &a[num-1], *inStart = &b[0], *inEnd = &b[num-1];
BTree bTree = createBTree(preStart, preEnd, inStart, inEnd);
postPrint(bTree);
system("pause");
return 0;
}