Skip to content
free
K
1
2
practice
Home
Math
English
Science
Social Studies
Contact
Language
English
Español
Sign In
/
High School Electives
/
Computer Science
/
Time-Space Tradeoffs
Grade Level
Computer Science
HSCS.164 Time-Space Tradeoffs
0%
Skill Level
🔴 Hard
00:00
Progress to Next Level
25% to Medium
Easy
Medium
Hard
Mastery
100%
A graph traversal on a graph with cycles keeps revisiting the same nodes and sometimes never finishes. Which added structure is the best justified memory use?
A
A second copy of the graph with the same cycles.
B
No storage at all because memory use should always be zero.
C
A visited set or bitset to record which nodes have already been explored.
D
A list of random nodes to visit if traversal repeats.
Submit Answer
