Data structure project

1- Linked Lists

2- Stack

3- Queue

4- Hashing

Implement a C++ program for HOTEL BOOKING. The program stores information of ROOM, BRANCH, HOTEL, and GUEST. Each BRANCH can be associated with one or more GUEST, and each BRANCH must be associated with a HOTEL. After the GUEST makes a certain number of booking, he or she will earn loyalty points that they use for discounts in future bookings. Class Names 1. Room Data and Member Functions Data Members: ID, RoomNo, bedCount, smoking Member Functions: getID, getRoomNo, getBed Count, getSmoking setID, setRoomNo, setBedCount, setSmoking 2. Branch Data Members: ID, Address, Phone Member Functions: getID,getAddress, getPhone setID, setAddress, setPhone 3. Hotel Data Members: ID, Name, stars Member Functions: getID, getName, getStars setID, setName, setStars 4. Guest Data Members: ID, Name, Phone, Points Member Functions: getID, getName, getPhone, getPoints setID, setName, setPhone, setPoints After developing these classes, the following four parts of the project must be implemented: Part1: Create the following Linked Lists: 1. Guest_List must store a list of Guest objects. 2. Branch_List must store list of Branch objects, and for each Branch, it must internally store a list of Room objects. 3. Booking_List must store a list that contains a pair of objects (Guest, Room). Main Function to test the above classes and data structures must display the following menu to the user: Main menu: 1. Guest 2. Branch 3. Booking Submenu under each item of Main Menu must have the following operations: (d) Display (i) Insert (r) Remove (m) Modify (1) Find Part 2: Covert the above lists in part 1 into Stack. Part 3: Covert the above lists in part 1 into Queue. Part 4: Covert the above lists in part 1 into Hashing