Given the root of a binary tree, determine if it is a valid binary search tree (BST).
Checking node 5. Range: (-inf, inf)
5
1
4
3
6