Given a binary tree, determine if it is a valid binary search tree (BST).
Click here
Recursively pass minimum, maximum down to nodes and check if both left child and right child satisfy those constraints, update min and max when needed. O(n) time, O(n) space.Run make to run python and Swift files.