Dynamic Data Structures – Linked List

A singly linked list stores nodes that contain data and a pointer to the next node.

struct Node {
    int data;
    struct Node *next;
};

Operations:

• Insert at head – O(1).
• Traverse – O(n).
• Delete – need previous node or use double‑linked list.

Memory management is manual – allocate nodes with malloc and free them when removed.