Check whether a binary tree satisfies the BST ordering rule.

For every node, all values in the left subtree must be strictly smaller, and all values in the right subtree must be strictly larger.