Explain Linked List With Example.
Linked ListsDefinition: a list of items, called nodes, in which the order of the nodes is determined by the address, called the link, stored in each node.
Every node in a linked list has two components: one to store the relevant information (the data); and one to store the address, called the link, of the next node in the list.
The address of the first node in the list is stored in a separate location, called the head or first.
The data type of each node depends on the specific application—that is, what kind of data is being processed; however, the link component of each node is a pointer. The data type of this pointer variable is the node type itself.
Linked Lists: Some Properties
The address of the first node in a linked list is stored in the pointer head
Each node has two components: one to store the info; and one to store the address of the next node
head should always point to the first node
Linked list basic operations:
Search the list to determine whether a particular item is in the list
Insert an item in the list
Delete an item from the list