Overview
This week we will again continue with our study of binary trees, culminating with Jelkner's favorite topic, heaps.
Monday and Tuesday, March 9th and 10th
Classwork
Today you will share your presentations of the binary tree topics you selected (or were assigned) last week.
After the presentations we will test the expect script Liam wrote to greatly improve our BSD C on CP/M workflow.
Homework
Section 12.1: Binary Heaps on pages 361 to 365 in our text. Write a program for BSD C that manages a max heap, interactively allowing users to insert and remove items from the heap.