c++,CPP,C++ Language (Linked List) Implement the singly linked list of Employee with data members Name, id and salary. Add at least 5 nodes in the list. You will create a pointer named as head to keep the address of first node of list. Create the following functions:
c++,CPP,C++ Language (Linked List) Implement the singly linked list of Employee with data members Name, id and salary. Add at least 5 nodes in the list. You will create a pointer named as head to keep the address of first node of list. Create the following functions:
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
c++,CPP,C++ Language (Linked List)
Implement the singly linked list of Employee with data members Name, id and
salary. Add at least 5 nodes in the list. You will create a pointer named as head to
keep the address of first node of list. Create the following functions:

Transcribed Image Text:Question no.1:
Implement the singly linked list of Employee with data members Name, id and
salary. Add at least 5 nodes in the list. You will create a pointer named as head to
keep the address of first node of list. Create the following functions:
Name
Name
Name
Name
Name
ID
ID
ID
ID
Head
Salary
Salary
Salary
Salary
Salary
Next
Next
Next
Next
Next=NULL
Createlist() to create a list of certain length.
• CreateNode() to create the nodes dynamically.
• readAlINodes() to get data of all nodes from user.
• readeNode() to get data of single node from user.
displayAlINodes() to print out data of complete list.
• displayNode() to print out the data of single node in a list.
• InsertAtHead() to insert the new node at the start of list.
• InsertAtlast() to insert the new node at end of the list.
• findLast() to find the last node in the list.
insertAtTarget() to insert the new node at user specified location in the list.
• findTarget() to find the target node where new node is to be inserted.
• deleteAtHead() to delete the first node at the start of list.
• deleteAtlast() to delete the last node at end of the list.
• findSLast() to find the second last node in the list.
• deleteAtTarget() to delete the node at user specified location in the list.
Date: 21/3/2021
findPrevTarget() to find the node before the target node which is to be
delete from list.
• Create a function to find the highest paid employee in the list and then
display its details.
NOTE: You can take help form the code given in lecture. You must know how
every function is working because I might take individual viva as well.
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education