For a binary search tree, key[l] ? <= key[n] ? <= key[r]. Different from a heap, in which the left-right ordering of values does not matter.