The Assignment -
In this assignment you will be Jeff Probst. Your job, Jeff, is to implement a game of Survivor. Our version of survivor gathers several castaways together in a wilderness. At first, they're split into two tribes. After a brief initial challenge, one tribe will be declared the initial winner.
Then there's a second round, where members of the winning tribe compete against one another. Two people go head-to-head in a fierce competition. The loser of each challenge gets voted off the island, and the other one stays. The season is over when there is one single castaway left in the tribe. That person is then declared the overall winners and gets a big fat cash prize.
You're going to make this all work using trees. The heart of your code will be a BinarySearchTree class that inherits from the Binary Tree class provided in the starter code. (You'll need to add more to the Binary Tree class as well.)
Requirement for this Project: Before you ask for help in office hours or on Piazza, you must have already written test code for your tree classes. If you think there's a problem with your BT or BST code, write a test function to verify that it works or doesn't work. Do that first, ask for help second.
Make sure you look for common cases and edge cases, like the following:
Can we find an item that isn't in the tree? That is in the tree? Will I seg fault if I try to find an item in an empty tree?
Does remove_item work when removing from an empty tree?
Can we remove a leaf, a two-child node, and a one-child node?
Does the copy constructor work on an empty tree? A full tree? An unbalanced tree?
Does the assignment operator work on an empty tree? A full tree? An unbalanced tree?
You may, but are not required to, submit your own test drivers along with your homework. There are a couple of bonus points on the line for doing a really good test driver! Provide it along with your other files, and we'll review it for thoroughness and quality of code.
Attachment:- Assignment Files.rar