Introduction to Singly linked list : A singly linked list is a set of nodes where each node has two fields ‘data’ and ‘link’. The ‘data’ field stores actual piece of information and ‘link’ field is used to point to next node. Basically ‘link’ field is nothing but address only.
Introduction to Doubly linked list : A Doubly Linked List (DLL) contains an extra pointer, typically called previous pointer, together with next pointer and data which are there in singly linked list.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Remove all even parity nodes from a Doubly and Circular Singly Linked List
- Difference between a Static Queue and a Singly Linked List
- Convert singly linked list into circular linked list
- Convert Singly Linked List to XOR Linked List
- XOR Linked List - A Memory Efficient Doubly Linked List | Set 1
- XOR Linked List – A Memory Efficient Doubly Linked List | Set 2
- Construct a Doubly linked linked list from 2D Matrix
- Find smallest and largest elements in singly linked list
- Alternate Odd and Even Nodes in a Singly Linked List
- Sum and Product of the nodes of a Singly Linked List which are divisible by K
- Sum and Product of all Prime Nodes of a Singly Linked List
- Minimum and Maximum Prime Numbers of a Singly Linked List
- Find minimum and maximum elements in singly Circular Linked List
- Sum and Product of the nodes of a Circular Singly Linked List which are divisible by K
- Sum and Product of all Fibonacci Nodes of a Singly Linked List
- Sum and Product of all even digit sum Nodes of a Singly Linked List
- Given only a pointer/reference to a node to be deleted in a singly linked list, how do you delete it?
- Given only a pointer to a node to be deleted in a singly linked list, how do you delete it?
- Function to check if a singly linked list is palindrome
- Alternating split of a given Singly Linked List | Set 1