2.1. Book Management
2.1. Book Management
About a reader:
1. rcode (string): the code of the reader (this should be unique for the reader).
2. name (string): the name of the reader.
3. byear (integer): The birth year of the reader (must between 1900 and 2010).
About a lending:
YOUR TASKS
You should use a binary search tree to store data for books and 2 linked lists, each one
is used to store data for readers or book lending items. You should create the data
structures from scratch, do not use structures available in java.
On running, your program displays the menu as below:
Books (8 marks) (using Binary Search Tree data structure, and bcode is the key of the
tree):
1.1. Load data from file
1.2. Input & insert data
1.3. In-order traverse
1.4. Breadth-first traverse
1.5. In-order traverse to file
1.6. Search by bcode
1.7. Delete by bcode by copying
1.8. Simply balancing
1.9. Count number of books
Submission Requirements
Create the directory with a name like <class>-<name><roll number>-ASS1, e.g.
SE0508-QuangTV00456-AS2 (1)
The (1) directory contains the following files:
Compress the folder (1) to .zip (or .rar) file (with the same name) and upload to cms.
Assignment assessment
You will be asked to modify immediately and to explain your assignment in lab room
to be sure that you are really the author of the assignment you submitted.