Summary

A data_structure stores and organizes data for efficient access and updates. Remember common types: array, linked_list, stack, queue, tree, graph, hash_table. Each type supports basic operations like insert, delete, search, and traverse. Know typical time_complexity for these operations. A data_structure is not an algorithm; the structure holds data, the algorithm is the procedure. Typical cues: stacks are LIFO, queues are FIFO, hash_table gives near O(1) lookup.