【无标题】c++日常练习（16）——从中序与前序遍历序列构造二叉树

#从中序与前序遍历序列构造二叉树

给定一个树的前序和中序遍历，请构造二叉树并返回其根节点。

#include <stdio.h>
#include<vector>
using namespace std;
struct TreeNode
{
int val;
TreeNode *left;
TreeNode *right;
TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution
{

private:
	unordered_map<int，int> inMap;
public:
	TreeNode *myBuildTree(vector < int>&preorder, int preStart, int preEnd, vector<int>&inorder, int inStart, int inEnd)
	{
		if(preStart>preEnd)
		return nullptr;
		TreeNode *root = new TreeNode(preorder[preStart]);
		int inRoot = inMap[preorder[preStart]];
		int numsLeft = inRoot - inStart;
		root->left = myBuildTree(preorder, preStart + 1, preStart + numsLeft, inorder, inStart, inRoot - 1);
			root->right = myBuildTree(preorder, preStart + numsLeft+ 1, preEnd , inorder, inRoot+1, inEnd);
				return root;
	}
	TreeNode *buildTree(vector < int> &preorder, vector < int> &inorder)
	{

		int n = preorder.size();
	for (int i = 0; i < n; i++)
		inMap[inorder[i]] = i;
	return myBuildTree(preorder, 0, n - 1, inorder, 0, n - 1);

	}
};