Another implementation of a Dictionary:use binary search tree

• A binary search tree is a binary tree with a key at each node u such that, for each node with left subtree L and right subtree R, we have

  • the key at u is greater than all the keys in L
  • the key at u is less than all the keys in R

Previous slide

Next slide

Back to first slide

View graphic version