Do this using C++ language using structures and singly linked list. Question no.1:Implement the singly linked list of Employee with data members Name, id andsalary. Add at least 5 nodes in the list. You will create a pointer named as head tokeep the address of first node of list. Create the following functions:NameNameNameNameNameIDIDHeadSalarySalarySalarySalarySalaryNextNextNextNextNextaNULL• 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 bedelete from list.• Create a function to find the highest paid employee in the list and thendisplay its details.

Given, To implement five of the following singly linked list operations with Employee Examples

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 Head Salary Salary Salary Salary Salary Net Net Net Net NetL Createlice/ ain length

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 Head Salary Salary Salary Salary Salary Net Net Net Net NetL Createlice/ ain length

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18SA

See similar textbooks

Similar questions

True/False Select true or false for the statements below. Explain your answers if you like to receive partial credit. 3) Which of the following is true about the insertBeforeCurrent function for a CircularLinked List (CLL) like you did in programming exercise 1?a. If the CLL is empty, you need to create the new node, set it to current, andhave its next pointer refer to itselfb. The worst case performance of the function is O(n)c. If you insert a new element with the same data value as the current node, theperformance improves to O(log n)
Add the following functions and write a program to test these functions in the classlinkedListType:a. Write the definition of a function that returns the data of the kth element of the linked list. If suchelement is not exist in the list, exit the program. (05)b. Write the definition of a function that deletes the kth element of the linked list. If such element isnot exist in the list, exit the program and display message as output.
Using user-defined function, create a C++ or Java application implementing a linked list datastructure. The application should be able to perform the following operations on the datastructure can with the following operations. i. insertion into the listii. deletion from the list iii. printing the content of the list
You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Function Description Complete the insertNodeAtTail function in the editor below. insertNodeAtTail has the following parameters: SinglyLinkedListNode pointer head: a reference to the head of a list int data: the data value for the node to insert Returns SinglyLinkedListNode pointer: reference to the head of the modified linked list Input Format The first line contains an integer , the number of elements in the linked list.The next lines contain an integer each, the value that needs to be inserted at tail. Constraints Sample Input STDIN Function ----- -------- 5 size of linked list n = 5 141 linked list data values…
Add the following functions and write a program to test these functions in the class linkedListType: a. Write the definition of a function that returns the data of the kth element of the linked list. If such element is not exist in the list, exit the program. b. Write the definition of a function that deletes the kth element of the linked list. If such element does not exist in the list, exit the program and display message as output.
Create a user-defined function called newBoss. This function will move the last node in some singly linked list to the beginning of the linked list (making it the new head). The function takes one argument, a reference to the head of the linked list of type node_t. You may use the following typedef structure. The function returns the new head of the linked list. typedef struct node_s{ int data; struct node_s * nextptr; }node_t;
Assume that the node of a linked list is in the usual info-link form with the info of the type of int. The following data, as described in parts (a) to (d), is to be inserted into an initially linked list: 72, 43, 8, 12. Suppose that head is a pointer of type nodeType. After the linked list is created, head should point to the first node of the list. Declare additional variables as you need them. Write the C++ code to create the linked list. After the linked list is created, write a code to print the list. What is the output of your code? Insert 72 into an empty linked list. Insert 43 before 72. Insert 8 at the end of the list. Insert 12 after 43
in c++ Create a single linked list that contains the data (age) of your friends. Perform basic operations including insertion, deletion, searching and display. The insertion operation should only allow a friend’s data to be inserted in sorted order only.
HELP Write C code that implements a soccer team as a linked list. 1. Each node in the linkedlist should be a member of the team and should contain the following information: What position they play whether they are the captain or not Their pay 2. Write a function that adds a new members to this linkedlist at the end of the list.
in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank you
Write a function that has two linked-list head pointers as parameters. Assume that the linked list's items are ordered by the 2-> 33 ->4 -> 5 =>1-> 2-> 3-> 3-> 4 ->5
Task 11: The following program is supposed to allocate nodes, put them into a linked list, print them out and then destroy them.Fix the bugs in the program and rewrite the code.Your program should have complete implementation required to run the following function.Take dummy data execute it, take snap shot and paste it in the document. struct linkedList { int number; linkedList* next; }; void AddNodel) { linkedlist* head = NULL; linkedList* current; for (int į = 0; inumber = i; current.next = head; head = current; } while (head->next != NULL) { cout number next; delete current; head = current; } return 0; }