[hr color=”red” border_width=”5px”]

Chapter 1 : Introduction to Linked List

Chapter 1 : Linked List in C Programming

Note :

Before Learning Linked List You Should Know Pointer and Dynamic Memory Allocation Concepts !!!!!

1.1 Introduction to Linked List

1. Introduction to Linked List
2. Advantages of Linked List
3. Disadvantages of Linked List
4. Array vs Linked-List

1.2 Types

1. Singly Linked List
2. Doubly Linked List
3. Circular Linked List

1.3 Singly Linked List Operations

• Create Linked List
• Traversing through Singly Linked List (SLL)
• Display Elements from First to Last
• Display Elements from last to First
• Counting Number of Nodes
• Searching Particular node in SLL
• Inserting Element at Front
• Inserting Element at End
• Inserting Element at Middle
• Delete First Elements
• Delete Middle Elements
• Delete Last Elements
• Concatenating two SLL
• Reversing / Inverting SLL
• Sorting of SLL
• Merging two sorted SLL
• Separating two Linked Lists
• Splitting two Linked List at the Middle
• Removal of Duplicate Elements from SLL