18: Implement a singly linked list.

⏳⌚ 00:00:00

Steps to solve:-

1. Node Structure:-
A Node structure is defined to represent individual elements of the singly linked list.
Each node contains two components: an integer data and a pointer next.
The data component stores the value of the node.
The next component is a pointer to the next node in the list.
2. Main Function:-
Inside the main function, the code starts by creating four nodes: head, temp, temp1, and temp2.
Each node is created using the Node constructor, and an initial value is assigned to the data component. For example, head is created with a data value of 10, temp with 20, temp1 with 30, and temp2 with 40.
3. Linking Nodes:-
The code then establishes the links between these nodes to create a singly linked list.
head->next is set to point to temp, which means that head is linked to temp.
temp->next is set to point to temp1, linking temp to temp1.
Similarly, temp1->next is set to point to temp2, linking temp1 to temp2.
4. Print the Data:-
After creating and linking the nodes, the code prints the data of each node to the standard output using cout.
The data values of head, temp, temp1, and temp2 are displayed, separated by spaces.
5. Return Statement:-
Finally, the main function returns 0, indicating successful execution.