A Singlely Linked List is a linear data structure in which the elements are not connected to each other.
Singly linked list can be defined as the collection of ordered set of elements.
The number of elements may vary according to need of the program. A node in the singly linked list consist of two parts: data part and link part.
Data part of the node stores actual information that is to be represented by the node while the link part of the node stores the address of its immediate successor.
Time complexity
- Insertion At Start: O(1)
- Insertion : O(n)
- Deletion At Start: O(1)
- Deletion : O(n)
- Search: O(n)
- Traversal: O(n)