Meeting 31: Binary Search Tree ADT

Today we will look at how binary trees can be used to provide fast storage for searching.