A BST must follow the Binary Search Tree property which states that the key in each node must be greater than all keys stored in the left sub-tree, and smaller than all keys in right sub-tree.
Traverse the Binary Tree. At each step check for the BST property. If the BST property is violated, return false. At the end of the traversal, return true.
