力扣第106题,从中序和后序构造二叉树

class Solution {
public:
	
	TreeNode* buildTree(vector<int>& inorder, vector<int>& postorder) {
		unordered_map<int, int> map;
		for (int i = 0; i < inorder.size(); i++)
		{
			map.insert(make_pair(inorder[i], i));
		}
		//范围是左右边界都包括,闭区间
		return dfs(inorder,0, postorder.size() - 1, postorder,0, inorder.size() - 1,map);
	}
	TreeNode* dfs(vector<int>&in, int post_start, int post_end, 
		vector<int>&post, int in_start, int in_end, unordered_map<int, int> &map)
	{
		if (post_start>post_end || in_start > in_end)
			return NULL;
		int root_val = post[post_end];
		TreeNode *root = new TreeNode(root_val);
		//找到根结点在中序中位置
		int in_root_pos = map[root_val];
		//左子树的结点数量
		int leftNum = in_root_pos - in_start;
		//后序前一部分是左子树,然后是右子树,然后最后是根结点,
		//所以post_start~post_start+leftNum-1是左子树的范围,post_start+leftNum~post_end是右子树的范围
		//中序左边是左子树,中间某一点是根,右边是右子树
		//所以in_start~in_root_pos-1 是左子树,in_root_pos是根结点, in_root_pos~in_end是右子树的范围
		root->left = dfs(in,post_start, post_start + leftNum - 1,post, in_start, in_root_pos - 1,map);
		root->right = dfs(in,post_start + leftNum, post_end - 1,post, in_root_pos + 1, in_end,map);
		return root;
	}
};