输入前序遍历、中序遍历输出后续遍历

//二叉树  输入前序遍历和中序遍历   输出后续遍历

// by nby

#include<iostream>

using namespace std;

void ACore(int *startpreorder, int *endpreorder, int *startinorder, int *endinorder)
{

if (startpreorder == endpreorder)
{
cout << startinorder[0] << " ";
return;
}



int i = 0;
while (1)
{
if (startpreorder[0] == startinorder[i])
break;
else
++i;
}
if (i > 0)
ACore(startpreorder + 1, startpreorder + i, startinorder, startinorder + i - 1);


if (i < endpreorder - startpreorder)
ACore(startpreorder + i + 1, endpreorder, startinorder + i + 1, endinorder);


cout << startpreorder[0] << " ";
}


// 输入前序遍历和中序遍历 输出后序遍历（前提 数组中数不能相等）
void A(int *preorder, int *inorder, int length)
{
if (preorder == NULL || inorder == NULL || length <= 0)
return;
else
ACore(preorder, preorder + length - 1, inorder, inorder + length - 1);
}


int main()
{
int preorder[] = { 1, 2, 4, 5, 6, 7, 3 };
int inorder[] = { 4, 2, 6, 5, 7, 1, 3 };

A(preorder, inorder, length);
cout << endl;

return 0;

}