CSC297.Java, Class 34: Heaps and BSTs

Admin:
* Thanks for your patience
* Review of homework
* Weekly Bishop Check
* New homework:
  * Fix Sam's delete (in BST.java), perhaps by using the "shove right subtree at end of left subree and return modified left subtree" strategy

Overview:
* See sample code.

Reminder:
* "ADT" is "Abstract Data Type"; Primarily a collection of operations and a "purpose for being"
* "Data Structure" is usually an implemenation of an ADT.