Code for singly linked list

Question

6. Develop algorithms using dynamic variables and pointers, to construct a singly linked list consisting of the following information in each node: student id (integer), student name (character string) and semester (integer). The operations to be supported are:

a. Inserting a nodei) at the front of a list ii) at the rear of the list ii) at any position in the list

c. Searching a node based on student id. If the specified node is not present in the list an error message should be displayed.

b. Deleting a node based on student id. If the specified node is not present in the list, an error Message should be displayed.

d. Displaying all the nodes in the list.

Code the same in C++

Answer 1

G Ganesh, the title says "Code for singly linked list" but I don't see any code here. What is your question?

(Please don't say you want someone to write the code for you.)