BST property

The rule that keeps a binary search tree searchable: left subtree keys are smaller than the node, right subtree keys are larger.

In more detail

Every insert and delete must preserve it, and an in-order traversal that comes out sorted confirms it holds. A common policy for duplicates is simply not to insert an equal key twice.

Related terms

Taught in

References