通过中序和后续遍历数组重建二叉树

void CreateTreeByMidAndPost(Node* node, char * mid, char * post, int size)
{
if(NULL ==node)
{
return;
}
if(1 == size )
{
node->value = post[size -1];
return;
}

node->value = post[size -1];
int subSize = 0;
while( post[size -1] != mid[subSize])
{
++subSize;
}

if(subSize > 0)
{
Node* child = new Node;
node->Left = child;
CreateTreeByPreAndMid(child, mid,post, subSize );
}

if(subSize < size)
{
Node* child = new Node;
node->Right = child;
CreateTreeByPreAndMid(child, mid+subSize + 1,post + subSize, size - subSize - 1);
}
}