Answer:
A list of linked data structures is a sequence of linked data structures.
The Linked List is an array of links containing items. Each link contains a link to a different link. The second most frequently used array is the Linked List.
Explanation:
Create a node class with 2 attributes: the data and the following. Next is the next node pointer.
Create an additional class with two attributes: head and tail.
AddNode() adds to the list a new node:
Make a new node.
He first examines if the head is equal to zero, meaning that the list is empty.
The head and the tail point to the newly added node when this list is vacant.
If the list isn't empty, the new node will be added at the end of the list to point to the new node of tail. This new node is the new end of the list.
Show() will show the nodes in the list:
Set a node current that first points to the list header.
Cross the list until the current null points.
Show each node by referring to the current in each iteration to the next node.
