Question

List different types of linear data structures.

Answer 1

• Array: fixed-size, contiguous indexed collection (random access).
• Linked list (singly, doubly, circular): nodes connected by pointers; flexible size, easy insertion/deletion.
• Stack: LIFO structure (push/pop).
• Queue: FIFO structure (enqueue/dequeue); variants: circular queue, deque (double‑ended queue), priority queue.
• String: sequence of characters (conceptually a specialised linear array).
• Record/Parallel arrays: grouped fields for a record, sometimes stored in parallel arrays.