Leetcode 1008. Construct Binary Search Tree from Preorder Traversal

Reconstruct a binary search tree given its preorder traversal (all values unique) by using the BST ordering together with the preorder sequence to determine which values belong to each node's left and right subtrees. The core challenge is partitioning the preorder list into valid left/right ranges (often solved with recursion using value bounds or an iterative stack).