The three basic data structures are:

1. Arrays: An array is a collection of items that are stored in a contiguous block of memory. Each item in an array is called an element, and elements are accessed using an index. Arrays are useful for storing and manipulating large amounts of data because they allow fast and efficient access to individual elements.
2. Linked lists: A linked list is a data structure that consists of a series of nodes, where each node stores a value and a reference to the next node in the list. Linked lists are useful for storing data when the size of the data is not known in advance, or when the data needs to be inserted or deleted frequently.
3. Stacks and queues: A stack is a data structure that allows elements to be added and removed only from the top of the stack, while a queue is a data structure that allows elements to be added only at the end of the queue and removed only from the front of the queue. Stacks and queues are useful for storing and manipulating data in a sequential manner.