🗺️ Map Operations
USACO C++ Book · Interactive Visualizer
🗺️ Map Operations — Insert/Find/Delete Full Demo
std::map
O(log N)
Step 0/8
📊 Internal BST Structure (keys in lexicographic order)
🗂 Map Current State
Key-Value Pairs (sorted by key)
Operation Result
Insert/Find/Delete:
O(log N)
Traverse:
O(N)
(ordered)
💻 Code
Hint
Click
Next Step ▶
to start and observe how map insert, find, and delete operations maintain the ordered structure.
◀ Prev
Next Step ▶
↺ Reset
0/8
Keyboard:
→
Next
←
Prev
R
Reset