Validate Binary Search Tree

This problem is part of solulu Pro

Return true if the tree is a valid binary search tree: for every node, all values in its left subtree are strictly smaller and all values in its right subtree are strictly greater, and both subtrees are BSTs.