LeetCode C++12-从前序遍历和中序遍历序列构造二叉树

题目描述

        给定两个整数数组preorder和inorder，其中preorder是二叉树的先序遍历，inorder是同一棵树的中序遍历，请构造二叉树并返回根节点。

示例：

如上图所示，先序遍历数组：[1, 2, 4, 5, 3]，中序遍历数组: [4, 2, 5, 1, 3]

代码

#include <iostream>
#include <vector>

struct TreeNode {
	int value;
	TreeNode* lchild;
	TreeNode* rchild;
	TreeNode(int value) {
		this->value = value;
		lchild = nullptr;
		rchild = nullptr;
	}
};

TreeNode* BuildTree(const std::vector<int>& pre_nums,
					const std::vector<int>& in_nums,
					int pre_start,
					int pre_end,
					int in_start,
					int in_end) {
	if (pre_start > pre_end) {
		return nullptr;
	}
	int in_mid = -1;
	for (int i = in_start; i <= in_end; i++) {//中序遍历结果中找根节点位置
		if (pre_nums[pre_start] == in_nums[i]) {
			in_mid = i;
			break;
		}
	}
	if(in_mid == -1) {
		return nullptr;
	}
	int lnum = in_mid - in_start;//左子树节点个数
	int rnum = in_end - in_mid;//右子树节点个数

	
	TreeNode* root = new TreeNode(pre_nums[pre_start]);
	// lchild
	root->lchild = BuildTree(pre_nums, in_nums, pre_start + 1,
						     pre_start + lnum, in_start, in_mid - 1);
	// rchild
	root->rchild = BuildTree(pre_nums, in_nums, pre_start + lnum + 1, 
							 pre_end, in_mid + 1, in_end);
	return root;
}

void preorder(TreeNode* root) { //先续遍历二叉树
	if (!root) {
		return;
	}
	std::cout << root->value << " ";
	preorder(root->lchild);
	preorder(root->rchild);
}

int main()
{
	// case:1 先序:1->2->4->5->3 中序: 4->2->5->1->3
    std::vector<int> pre_nums = {1, 2, 4, 5, 3};
	std::vector<int> in_nums = {4, 2, 5, 1, 3};
	int pre_size = pre_nums.size();
	int in_size = in_nums.size();
	TreeNode* root = BuildTree(pre_nums, in_nums, 0, 
			 pre_size - 1, 0, in_size - 1);
	preorder(root);
    return 0;
}

代码运行结果如下：

1 2 4 5 3