Dear members,
I am self practicing C++ and I am interested to understand ADTs in C++. It became challenging to understand, but seems very interested. So for my clear understanding, I invite any member to assist me to understand the implementation of linked list using pointers in dynamic memory allocation in a very simple example of hospital system (just for my academic purpose). So the following is my problem of statement.

- A hospital has five Wards. Each ward has ten rooms. Each room has six beds. And each bed in each room has assigned a unique bed number.
- I need to keep two separate lists with the following information:
1. Admitted: Full Name, Age, Sex, Date Admitted, City, Telephone, and Remark
2.Treated: Full Name, Age, Sex, Date Sent Off, City, Telephone, and Remark
-A new admitted patient will be registered to his/her detail information on Admitted list
-A patient who gets treated and sent left the hospital has to deleted from the Admitted list and transferred to the Treated list
Based on the above info I need to create a linked list that perform the following operations:

-Initialize()
-IsEmpty()
-IsFull()
-SearchName(): Given the Name, searches for the ward, room and bed number of the patient
-SearchBed(): Given the bed number, room, and ward, searches for the name of a patient
-IsFree(): Test whether a bed is free in a given ward and room.
-Transfer(): Transfers a patient to another given ward, room, and bed number, given the current ward, room, and bed number of the patient
-Admit(): Inserts all the required information about a patient when admitted
-Treated(): Makes a bed free after a patient is treated and sent off from the hospital; and delete from Admitted list and adds to the list of treated
-ListFree(): List all the free beds in the hospital
-SearchTreated(): Given the name, searches for a treated and sent off patient

Please provide me a source code for above requirements including all the necessary definitions using structured C++ program language in very simple way.

Thank you all!
Yesuf Adane