next up previous
Next: Example Up: CSE 2320: Algorithms and Previous: Binary Search Trees

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.

Copyright © 1998 The University of Texas at Arlington