Verify Preorder Sequence in Binary Search Tree

Given an array of integers, determine whether it can represent the preorder traversal of a binary search tree by checking that each node respects BST ordering as you scan the sequence. This is typically solved in O(n) time by simulating the traversal with a stack or a running lower bound to track when you move into right subtrees.