Using BSTs for Table ADTs
•For test operations,
we must define a binary search tree where for
each node -- the search key is greater than
all search keys in the left subtree and less than all search keys in the right subtree.
–Since this is
implicitly a sorted tree when we traverse it inorder, we can write efficient algorithms for
retrieval, insertion, deletion, and traversal.
–Remember, traversal of
linear ADT tables was not a straightforward
process!