Singly Linked List
Domain: Data Structures
🎯 Motivation
When you only need to move forward through a sequence, a singly linked list uses minimal memory — each node points only to the next.
📋 Concrete Example
Head -> [A|->] -> [B|->] -> [C|null]. You can only go forward. To find the 3rd element, you start at head and follow two next-pointers.
🔗 Analogy
A one-way street. You can drive forward from house to house, but you cannot turn around and go back. To revisit a previous house, you must start over from the beginning.