面试题7：重建二叉树

#include<iostream>
using std::endl;
using std::cout;
using std::cin;

struct BinaryTreeNode
{
	int m_nValue;
	BinaryTreeNode* m_Pleft;
	BinaryTreeNode* m_Pright;
};

BinaryTreeNode* ConstructCore(int* startPreorder, int* endPreorder, int* startInorder, int* endInorder)
{
	//前序第一个为根节点
	int rootValue = startPreorder[0];
	BinaryTreeNode* root = new BinaryTreeNode();
	root->m_nValue = rootValue;
	root->m_Pleft = nullptr;
	root->m_Pright = nullptr;
	if (startPreorder == endPreorder)//当前序和中序只有一个并相等时返回根节点 
	{
		if (startInorder == endInorder && *startPreorder == *startInorder)return root;
		else throw std::exception("Invalid Input");
	}
	int* rootInorder = startInorder;
	//在中序中找到根节点位置
	while (rootInorder <= endInorder && *rootInorder != rootValue)
		++rootInorder;
	if (rootInorder == endInorder && *rootInorder != rootValue)//当中序没有前序中的节点时，抛出异常
		throw std::exception("Invalid Input");
	int leftLength = rootInorder - startInorder;//左子树的长度
	int* leftPreorderEnd = startPreorder + leftLength;//左子树的终止位置
	if (leftLength > 0)//构建左子树
	{
		root->m_Pleft = ConstructCore(startPreorder + 1, leftPreorderEnd, startInorder, rootInorder - 1);
	}
	if (leftLength < endInorder - startInorder)//构建右子树
	{
		root->m_Pright = ConstructCore(leftPreorderEnd + 1, endPreorder, rootInorder + 1, endInorder);
	}
	return root;
}

BinaryTreeNode* Construct(int* preorder, int* inorder, int length)
{
	if (preorder == nullptr || inorder == nullptr || length <= 0)
		return nullptr;
	return ConstructCore(preorder, preorder + length - 1, inorder, inorder + length - 1);
}
void printfTree(BinaryTreeNode* root)
{
	if (root)
	{
		cout << root->m_nValue << " ";
		printfTree(root->m_Pleft);
		printfTree(root->m_Pright);
	}
}
int main()
{
	int preorder[8] = { 1,2,4,7,3,5,6,8 };
	int inorder[8] = { 4,7,2,1,5,3,8,6 };
	BinaryTreeNode*root=Construct(preorder, inorder, 8);
	printfTree(root);
	cin.get();
	cin.get();
	return 0;
}