juniorLinked Lists
What is the 'Head' and 'Tail'?
Updated Apr 28, 2026
Short answer
Head is the first node; Tail is the last node (usually pointing to null).
Deep explanation
Linked lists are the foundation of dynamic data structures. Head is the first node; Tail is the last node (usually pointing to null). They provide O(1) insertion at the front, which is superior to O(n) in arrays.
Real-world example
Undo functionality in text editors.
Common mistakes
- Forgetting to handle the case where the list is empty (Null check).
Follow-up questions
- What is the search complexity?