Singly linked list : C ProgrammingPritesh
Singly Linked List : C Programming Data Structure
- In this type of Linked List two successive nodes are linked together in linear fashion .
- Each Node contain address of the next node to be followed.
- In Singly Linked List only Linear or Forward Sequential movement is possible.
- Elements are accessed sequentially , no direct access is allowed.
- It is most basic type of Linked List in C.
- It is simple sequence of Dynamically allocated Nodes.
- Each Node has its successor and predecessor.
- First Node does not have predecessor while last node does not have any successor.
- Last Node have successor reference as “NULL“.
- In the above Linked List We have 3 types of nodes.
1.First Node 2.Last Node 3.Intermediate Nodes
- In Singly Linked List access is given only in one direction thus Accessing Singly Linked is Unidirectional.
- We can have multiple data fields inside Node but we have only single “Link” for next node.