This document discusses singly linked lists. It explains that each element contains a data field and a next pointer field pointing to the next node. The last element's next pointer points to null since it is the end of the list. It also describes how the next pointers of each node get filled, with the next of the last node pointing to null. Finally, it gives examples of applications like stacks and queues that can be implemented using linked lists.

1. SINGLY LINKED LIST
Submitted by :Aman
Badiwal

2. SINGLY LINKEDLIST
• T10h0e0e,le2m00e0ntasnAd13,0A020,rAe3spaercetipvreelys.entinthe node whose address is
• Each element has next pointer which points to its successor node.
• TlinhkeeedlelmistensotAit3hhoaldssnnouslulcvcaelusseoorb0ecaasuiste'sinteixst.helast element inthe

3. LINKEPODILNITSETRWVIATLHUAECSTUAL
• This part says how the next of each node will be filled.
• First, the address of A3 is assigned as nextofA2

4. • The address ofA2 is assigned as next ofA1.
LINKED LIST WITHACTUAL
POINTER VALUES

5. LINKED LIST WITHHEADER
• AadsdfraerssasofseAe2n,isthaessaidgdnreedssaosfnAex3tiosfaAss1i.gnedasnext of A2 andthe
• Wofheeraeddero.estheaddress of A1 gets stored? This gives theintroduction
• Thus the address ofA1 is present in theheader.

6. APPLICATIONS OF LINKEDLIST
STACK

7. APPLICATIONS OF LINKEDLIST
QUEUE