Editing Data Structures (section)

== <span style="color: #FFFFFF;">Remembering</span> ==
* '''Data Structure''' — A way of organizing data so that it can be used efficiently.
* '''Array''' — A collection of items stored at contiguous memory locations; indexed by number.
* '''Linked List''' — A linear collection of data elements where each element points to the next.
* '''Stack''' — A "Last-In, First-Out" (LIFO) structure (like a stack of plates).
* '''Queue''' — A "First-In, First-Out" (FIFO) structure (like a line at a store).
* '''Hash Table''' — A structure that maps "keys" to "values" using a hash function (O(1) lookup).
* '''Tree''' — A hierarchical structure with a "root" and "child" nodes (e.g., Binary Search Tree).
* '''Graph''' — A set of nodes (vertices) connected by lines (edges); used to model networks.
* '''Heap''' — A specialized tree-based structure used for priority queues.
* '''Set''' — A collection of distinct elements with no specific order.
* '''Pointer''' — A variable that stores the memory address of another variable.
* '''Abstract Data Type (ADT)''' — A mathematical model for data types (defines what it does, not how it's implemented).
* '''Dynamic Array''' — An array that can resize itself during execution (e.g., Python list).
* '''Trie''' — A specialized tree used for searching strings (e.g., for autocomplete).
</div>

<div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">