Skip to content
Gallery
Backend Development | Mid-Track Exam 2 Refresher
Backend Development | Mid-Track Exam 2 Refresher
Share
Explore
Data Structures and Algorithms

Linked Lists

Introduction to Linked Lists:

Efficiently manage data and connections.
Similar to a train where each carriage (node) is connected.

Components of Linked Lists:

Head: First node.
Tail: Last node, pointing to null.

Operations on Linked Lists:

Traversal: Start at the head and follow links to the tail.
Insertion: Connect new node to the last node.
Deletion: Detach a node and link previous node to the next.

Advantages of Linked Lists:

Dynamic Size: Grow or shrink as needed.
Efficient Insertions and Deletions: Especially at the list's beginning, often O(1).

Drawbacks of Linked Lists:

Slower Element Access: O(n) time complexity.
Memory Efficiency: Extra pointers increase overhead.
Memory Management: Complex node pointer handling.

Types of Linked Lists:

Singly LinkedList:
Nodes reference the next node, allowing one-way traversal.
Doubly LinkedList:
Nodes have pointers to both next and previous nodes, enabling two-way traversal.
Circular LinkedList:
Last node points back to the first, forming a loop.
Types: Singly Circular and Doubly Circular.
For more detailed information, refer to the Notion link:
Linked Lists
⁠
⁠
Want to print your doc?
This is not the way.
Try clicking the ⋯ next to your doc name or using a keyboard shortcut (
CtrlP
) instead.