A linked list is a linear data structure where elements, called nodes, are stored in a sequence, and each node points to the next, allowing for efficient insertion and deletion. Unlike arrays, linked lists do not require contiguous memory allocation, making them flexible in dynamic memory management, but they have slower access times due to sequential traversal.