Lecture 13 - Memory

Activity/Homework

DUE Friday, FEB. 26^TH. Submit your java files to inquire by the beginning of class.

Details

Write a class in Java called BinaryTree, which represents a binary search tree. You can chose either implementation you prefer for storage, but at the very least:

• Stores one piece of data per node
• Has the ability to insert, delete, and lookup. For lookup, your function should return True if it finds it, and False otherwise.

Create a program you can use to test your program. Make sure you test all of the methods of your classes.