Location Hierarchy
Visualizing the Max Heap data structure based on average scores
📚 Data Structure: Max Heap
A binary tree where each parent node has a higher score than its children. Root contains the highest-scored location.
Insert
O(log n)
Extract Max
O(log n)
Peek Max
O(1)
🏆 Rankings (Sorted by Average Score)
🌳 Heap Tree Structure
Visual representation of the Max Heap. Each level shows parent-child relationships.
🧮 How It Works
1. Data Collection
Students record memories and observations for each location with scores (1-10)
2. Average Calculation
For each location, we calculate the average score from all recordings
3. Heap Construction
Locations are inserted into a Max Heap where parent nodes always have higher scores than children
4. Hierarchy Visualization
The tree structure shows which locations are most important/emotional/intense (at the top)