已知二叉搜索树(BST)的前序(或后序)遍历数组重建BST(改进版)

已知BST的前序遍历数组重建BST

#include <iostream>
#include <vector>
using namespace std;

struct TreeNode {
   
	TreeNode* left;
	TreeNode* right;
	int date;
	TreeNode(int value) :
		date(value), left(nullptr), right(nullptr)
	{
    }
};

void preTraversal(TreeNode* root) {
   
	if (root == nullptr) {
   
		return;
	}
	cout << root->date << " ";
	preTraversal(root->left);
	preTraversal(root->right);
	delete root;
}

TreeNode* buildBSTree(vector<int>& pre, int left, int right) {
   
	if (pre.empty() || left < 0 || right < 0<