Is collateral beauty on redbox

Red Box Inventory

KEY ITEMS: Key items are marked in red. Failure to include or complete key items will incur additional deductions

as noted beside the item.

Submission:

• The file containing main must be named Main.java. (-5 points)

• The project files must be in packages that start with RedBox.* (-5 points)

• All project deliverables are to be submitted in eLearning

o Add your project’s presentation link in the comments section in eLearning

• Zip the contents of the src directory into a single zipped file

o Make sure the zipped file has a .zip extension (not .tar, .rar, .7z, etc.) (-5 points)

• Programs must compile and run with Java SE 13.

• Each student is responsible for developing unit test cases to ensure the program works as expected.

• Type your name and netID in the comments at the top of all files submitted. (-5 points)

Objectives:

• Implement a binary search tree class in Java

• Utilize a binary search tree

• Create a modular code solution with multi-packages

• Use the Singleton pattern to create and manage the Scanner object

• Use Java Generics to create generic classes and methods

Problem: Redbox needs a program to track inventory and to generate a report for their DVD rental kiosks. Given

a log of transactions including renting and returning DVDs as well as adding and removing DVD titles, the program

will need to process each transaction and create a report after all transactions have been processed. The

generated report will list all DVD titles stored in the kiosk as well as how many of each disc are in the kiosk.

Details:

• The inventory will be held in a binary search tree that you will create (-15 points if not)

• Use the DVD title to determine node placement in the tree

• The binary tree will be seeded with an inventory file

• Once seeded, the program will parse a transaction log to update the inventory

• There are five possible transactions:

o Add

▪ Add a new title

• Create a new node and insert it into the tree

▪ Add copies to an existing title

• Find the title in the tree and increase the number of available copies by the

amount listed

o Remove copies of an existing title

▪ Find the title in the tree and reduce the number of available copies by the amount listed

▪ If number available is zero and no copies are rented out, delete the node from the tree

▪ There will not be more copies removed than available.

o Rent a DVD

▪ Reduce available amount of an existing title by one and increase rented amount by one

o Return a DVD

▪ Increase available amount of an existing title by one and reduce rented amount by one

Classes:

• Node

o Members

▪ Title (string – case insensitive)

▪ Available (integer)

▪ Rented (integer)

▪ Left (node pointer)

▪ Right (node pointer)

o Methods

▪ Overloaded constructor

▪ Mutators

▪ Accessors

• Binary Search Tree

o Binary Search Tree class must use generics (-5 points if not)

o Members

▪ Root (node pointer)

o Methods

▪ Mutator

▪ Accessor

▪ Insert (recursive) (-5 points if not)

▪ Search (recursive) (-5 points if not)

▪ Delete

▪ Other methods that are necessary to interact with a binary search tree

• Remember that methods should be generic to be used on a binary tree regardless

of the problem and data type.

User Interface and Input: There is no user interface for this program. Input will be loaded from two files,

inventory.dat and transaction.log. The inventory.dat is assumed to be error free and it will be

read first by your program and loaded into a binary search tree. Each line (except the last line which may not have

a newline character) in inventory.dat will be formatted as follows (NOTE: represents a variable value):

“