Hide Index
Doubly Linked List
0% completed
Introduction to doubly linked lists
Traversal in doubly linked lists
Insertion in doubly linked lists
- Understanding insertion at beginning
- Insert at beginning
- Understanding insertion at end
- Insert at end
- Understanding insertion after the given node
- Insert after the given node
- Understanding insertion before a given node
- Insert before the given node
- Understanding insertion at a given distance
- Insert at given distance
Deletion in doubly linked lists
- Understanding deletion of first node
- Delete first node
- Understanding deletion of last node
- Delete last node
- Understanding deletion by given data
- Delete node with given data
- Delete nodes with given data
- Understanding deletion after a given node
- Delete node after the given node
- Understanding deletion before a given node
- Delete node before the given node
- Understanding deletion of the given node
- Delete the given node
- Understanding deletion at a given distance
- Delete node at given distance
Pattern: Reversal
Pattern: Reversal (Subproblem)
Pattern: Two pointers
Pattern: Reorder
Assessments
Certificate
Identifying direct application
The linked list reversal algorithm can only be directly applied to specific problems that fall under the reversal pattern. These are generally easy problems where we must reverse the entire list or a part of it to solve. If the problem statement or its solution follows the generic template below, it can be solved by using the linked list reversal algorithm directly.
Template
Given a doubly linked list and two nodes
Given a doubly linked list and two nodes
start and end, reverse the linked list between these two nodes.Example
Liking the course? Check our discounted plans to continue learning.