Data Structure and Algorithm:

Suppose you want to store the records of the employees of your company. They all have employee ID's like IT-012 for the IT department, LG-012 for the Legal department, RD-012 for the records department, and so on. Today, you get a message from the office that "Mr. Habib " has been promoted to Senior Procurer of Office Foodstuffs (SPOF), and because you're in the Database department you have to update his records (he got promoted from Junior Procurer). They also tell you his employee ID,IT-6767. In the massive company where you work, there are literally thousands of employees. To make stuff worse, "Habib" is a pretty common name, and there may be many Habib’s in different departments. So, what do you do? Design a relevant data structure which stores the information of all the employees. 

Now it’s your task to maintain all departments and store 5 to 10 employees with their IDs, then search the employee ID of ‘Mr. Habib’ to change the post in database. For this you have to print the updated record of promoted employee.

Note: You are not allowed to use any built-in Data Structure classes to implement above scenario.