面试题7：重建二叉树

/*******************************************************************
*《剑指Offer——名企面试官精讲典型编程题》C++代码
*
* htfeng
* 2018.09.20
*
* 面试题7：重建二叉树
* 题目：输入某二叉树的前序遍历和中序遍历结果，请重建该二叉树。假设输入的前序遍历和中序遍历的结果
* 中都不含有重复的数字。
*******************************************************************/

#include<iostream>
#include<exception>
#include "include/BinaryTree.h"

using namespace std;

BinaryTreeNode* ConstructCore(int* startPreorder, int* endPreorder, int* startInorder, int* endInorder);

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);
}

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("Invaild input.");
	}

	int* rootInorder = startInorder;
	while (rootInorder <= endInorder && *rootInorder != rootValue)
		++rootInorder;
	while (rootInorder == endInorder && *rootInorder != rootValue)
		throw std::exception("Invaild input");

	int leftLength = rootInorder - startInorder;
	int* leftPreorder = startPreorder + leftLength;
	if (leftLength > 0) {
		root->m_pLeft = ConstructCore(startPreorder + 1, leftPreorder, startInorder, rootInorder - 1);
	}
	if (leftLength < endPreorder - startPreorder) {
		root->m_pRight = ConstructCore(leftPreorder + 1, endPreorder, rootInorder + 1, endInorder);
	}

	return root;
}

// ====================================测试程序===================================
void Test(char* testName, int* preorder, int * inorder, int length) {
	if (testName != nullptr)
		cout << testName << " begin:" << endl;

	cout << "The preorder sequence is:";
	for (int i = 0; i < length; i++)
		cout << preorder[i] << " ";
	cout << endl;

	cout << "The inorder sequence is:";
	for (int i = 0; i < length; i++)
		cout << inorder[i] << " ";
	cout << endl;
	
	BinaryTreeNode* root = Construct(preorder, inorder, length);
	PrintTree(root);
	DestroyTree(root);
}

//普通二叉树
void test1() {
	char testName[] = "test1 ";
	int preorder[] = { 1,2,4,7,3,5,8,6 };
	int inorder[] = { 4,7,2,1,5,3,8,6 };
	int length;
	length = sizeof(preorder)/sizeof(int);
	Test(testName, preorder, inorder, length);
}

//特殊二叉树
void test2() {
	char testName[] = "test2 ";
	int preorder[] = { 1,2,4,7 };
	int inorder[] = { 4,7,2,1 };
	int length;
	length = sizeof(preorder) / sizeof(int);
	Test(testName, preorder, inorder, length);
}

// 特殊输入测试
void test3() {
	char testName[] = "test3 ";
	Test(testName, nullptr, nullptr, 0);
}

int main() {
	test1();
	test2();
	test3();
	system("pause");
	return 0;
}