Section 8.2 Binary Search Trees
We have already seen lists and hashing as approaches for implementing the map and set abstract data types. In this section we will study binary search trees as yet another way to implement these abstract data types. For this application, we are not interested in the exact placement of items in the tree as we were in the previous chapter, but we are instead interested in using the binary tree structure to provide for efficient searching.
You have attempted of activities on this page.
