This slide deals with the assignment of address in the singly linked list with an example. Then, it is followed by the linked list with header value and applications of LL.
2. SINGLY LINKED LIST
• The elements A1, A2, A3 are present in the node whose address is
1000, 2000 and 3000 respectively.
• Each element has next pointer which points to its successor node.
• The element A3 has no successor because it is the last element in the
linked list so it holds null value or 0 as it's next.
3. LINKED LIST WITH ACTUAL
POINTER VALUES
• This part says how the next of each node will be filled.
• First, the address of A3 is assigned as next of A2
4. • The address of A2 is assigned as next of A1.
LINKED LIST WITH ACTUAL
POINTER VALUES
5. LINKED LIST WITH HEADER
• As far as seen, the address of A3 is assigned as next of A2 and the
address of A2 is assigned as next of A1.
• Where does the address of A1 gets stored? This gives the introduction
of header.
• Thus the address of A1 is present in the header.
6. APPLICATIONS OF LINKED LIST
TRAIN
• In the train, each part represents the node and all the parts are
connected by the link.
7. APPLICATIONS OF LINKED LIST
QUEUE OF CHILDREN
• The queue of children are connected by the hands which acts as a link.