The ___________ property in binary search trees ensures that for every node, all nodes in its left subtree have keys less than its own, and all nodes in its right subtree have keys greater than its own.

The property in binary search trees that ensures all nodes in the left subtree have keys less than the node's own key, and all nodes in the right subtree have keys greater than the node's key is known as the order property. This property is fundamental to the functioning of binary search trees as it enables efficient searching by narrowing down the search space at each step based on the comparison of keys.