Linked lists for absolute beginners

Description

In this course, you will :

• Create the data structure for a singly and doubly linked list
• Insert any element wherever in the linked list
• Remove an element from the linked list
• Understand how the linked list is allocated in memory
• Properly deallocate the linked list
• And to code other useful algorithms

Syllabus :

1. Singly-linked lists

• Introduction to linked lists
• Iterating a linked list
• Inserting at the end
• Deallocating (or deleting) a linked list
• Inserting at the beginning
• Inserting after a node
• Inserting in a sorted list
• Removing an element
• Reversing a linked list
• Detecting cycles/loops
• Introduction to recursive functions on linked lists, counting the number of elements

 

2. Doubly linked lists

• Introduction to doubly linked lists
• Iterating a doubly linked list
• Deallocating (or deleting) a doubly linked list
• Inserting at the beginning
• Inserting at the end
• Inserting after a node
• Removing a node
• Finding a node
• Reversing a doubly linked list

Show more