📊 Module 02: Data Structures¶

Learn how to organize and store data efficiently. From Python's built-in collections to classic computer science structures.

What's in This Module¶

Topic	Description
01_lists_arrays	Ordered, mutable collections
02_strings	Text manipulation deep-dive
03_dictionaries_maps	Key-value data storage
04_sets	Unique, unordered collections
05_tuples	Immutable sequences
06_stacks_queues	LIFO and FIFO structures
07_linked_lists	Node-based linear structures
08_trees	Hierarchical data organization
09_graphs	Network-like connections
10_hash_tables	Fast key lookups explained

By the end of this module, you will:

⏱️ 12-15 hours total for this module

fruits = ["apple", "banana", "cherry"]
fruits.append("date")      # Add to end
fruits[0] = "apricot"      # Modify by index

person = {"name": "Alice", "age": 25}
person["city"] = "NYC"     # Add new key
print(person["name"])      # Access by key

unique = {1, 2, 3, 3, 3}   # {1, 2, 3}
a = {1, 2}
b = {2, 3}
print(a | b)               # Union: {1, 2, 3}

Need	Use
Ordered collection, duplicates OK	`list`
Fast key lookups	`dict`
Unique elements only	`set`
Immutable sequence	`tuple`
Last-in-first-out	Stack (list)
First-in-first-out	Queue (deque)

Begin with 01_lists_arrays — the most versatile built-in structure.