Summary

A linked_list is a sequence of node elements. Each node stores data and a next_pointer. The head points to the first node. The tail points to the last node. A singly_linked_list uses one pointer. A doubly_linked_list also includes a prev_pointer. Basic actions are traversal, insertion, and deletion. Insertion at the head is usually constant time. Search and index access are linear time. Linked lists grow dynamically by adding new nodes.