DIY: Validate the Binary Search Tree

Explore how to validate whether an integer array represents the in-order traversal of a valid binary search tree. Learn to implement the InorderBST function, handling input constraints and producing outputs that determine the BST validity.