When the key of every node of a binary tree is larger than the key of its left child and smaller than its right child. A binary tree which has this property is a binary search tree.