29 août 20193 août 2020 Bastien Pasdeloup When removing an element from a FIFO, we get... the last element that was added. the first element that was added. A DFS can be implemented using... a LIFO to store the next unexplored vertices to be visited. a LIFO to store the list of all neighbors of the starting vertex. a FIFO to store the next unexplored vertices to be visited. We add the elements 10, 25, 52, 40, 20, then 40 to a LIFO (in this order). What is the correct sequence (read from the left to the right) when performing four consecutive removals? 40, 20, 40, 10 (first we pop 40). 40, 20, 40, 52 (first we pop 40). 10, 25, 52, 40 (first we pop 10). Time is Up!
