Write a function to check if a binary tree is a binary search tree (BST). A BST is a binary tree where for every node, all the nodes in its left subtree are less than the node, and all the nodes in its right subtree are greater than or equal to the node.