Work with the pairs assigned last week on the BST implementation we discussed then. Prepare for a presentation of your work in class on Monday, May 7th.

In addition to a basic binary tree implementation, let's assign the following specific tasks to individual pairs:

• Caleb and Turner: console visualization of binary trees
• Jametheil and Ved: binary search tree (BST)
• Anar and Adonis: binary search tree (BST)
• Isaac and Marin: Expression tree
• Akshay and Cody: AVL tree
• Anfal and Trostin: Red-black tree
• Parker and Johan: Huffman's tree
• Luis and Mulbah: Splay tree

Our CSC 223 Group Presentation Rubric will obviously need to be adapted for this project, since we are using Ruby instead of C++. I won't insist on RSpec tests, but having them would be a sure fire way to earn an A on your presentation ;-) Otherwise, the rest of the rubric works.