Question

Write a program to create a dictionary class using BST that allows to insert, delete, display in-order and search records. Each record represents a book and should contain, book title, author name, number of copies, publication year. Insert the record using book title as key.

Answer 1

A dictionary class for managing book records using a BST involves creating a Book Node with book specifics and methods for insertion, deletion, in-order display, and search. The book title is the key for sorting the records within the BST.

Step-by-step explanation:

Creating a Dictionary Class with BST

To create a dictionary class using a Binary Search Tree (BST) to store records of books, you need to define a Book Node that contains the book title, author name, number of copies, and publication year. The book title will serve as the key for insertion in the BST. The class should have methods for insertion, deletion, in-order display, and search functionality.

Methods Explanation:

Insertion: Add a new book to the dictionary. The placement is determined by the book title.

Deletion: Remove a book from the dictionary.

In-order Display: Print the books in alphabetical order, based on their titles.

Search: Locate a book in the dictionary using its title.

Each method should be designed to efficiently manage the data within the BST structure, maintaining the proper order and adhering to the properties of the BST.