pOne of the tree applications in Chapter 9 is binary search trees. pIn Chapter 9, binary search trees are used to implement bags and sets. pThis presentation illustrates how another data type called a dictionary is implemented with binary search trees.
Binary Search Trees
Data Structures
and Other Objects
Using Java
This lecture shows a common application of binary trees: Binary Search Trees used to implement a Dictionary data type.
Before this lecture, students should have a good understanding of binary trees, and should have seen some basic container data types similar to a dictionary (for example, a bag or a set).