12. Binary Search Trees

In this chapter, we discuss a new data structure: binary search trees. Binary search Trees (BSTs) are known to allow for faster operations on searching and inserting.