Beginner 10 planned topics Algorithms
Introduction to Linked List
Learn singly and doubly linked lists, pointers, and common interview tasks. Free linked list introduction.
Learning Outcomes
- Draw a singly linked list and reverse it on paper
- Insert and delete a node
- Explain dummy nodes
- Detect a cycle with Floydβs idea at a high level
Overview
A linked list stores nodes that point to the next node. Insert and delete at the head are cheap; random access is not.
This introduction covers traversal, dummy heads, and the two-pointer trick.
It is a core GATE and campus-interview topic.
What this course will cover
- 1. Singly list
- 2. Doubly list
- 3. Insert/delete
- 4. Reverse
- 5. Two pointers
- 6. Practice
Start a complete tutorial now
Full 6-level lessons are live for C, C++, Java, Python, and JavaScript. Use them while the remaining Linked List lessons are added.