Leetcode 98. Validate Binary Search Tree

Determine whether a binary tree is a valid binary search tree by checking that each node's value is strictly greater than all values in its left subtree and strictly less than all values in its right subtree. This requires a traversal that enforces global min/max bounds from ancestors (or equivalently verifies an inorder traversal yields a strictly increasing sequence).