In a binary search tree (no duplicates), the info in all of the nodes in the left subtree of a node are less than the info in all of the nodes in the right subtree of the node.