Binary Search Tree Property

n = node in BST

l = node in left subtree of n

r = node in right subtree of n

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.