We'll begin with a quick look at Parker's prettyprint_bintree.rb code, which you can use to nicely print trees to the console.

We will then have a short quiz on the presentations from last class.

After that we will discuss our last binary tree topic, Huffman Coding ( here too), and introduce our final projects for the course. You choose the pairings last week, and I am assigning you the following topics:

• Jametheil and Marin: The O(n²) sorting algorithms - bubble sort, insertion sort and selection sort
• Akshay and Turner: Graphs
• Johan and Trostin: B-trees
• Anfal and Ved: The O(n log n) sorting algorithms - merge sort and quick sort
• Caleb and Cody: Hashing and hashmaps
• Anar and Adonis: Heaps and heapsort
• Isaac and Parker: B-Trees

Today we will share several of the presentations that were assigned last week. The remaining ones will be presented at the beginning of class on Friday. If you do not present today, use homework time to be sure you are ready next class.