Oris
Today
Universe
Explore
Studio
Authors
Account
Lesson 1 of 6
DFS explores as deep as possible before backtracking, using:
A stack (or the call stack via recursion)
A FIFO queue
A priority queue
A hash set only
Check
Today
Universe
Explore
Profile