An iterative DFS traversal algorithm uses a(n)______.
A)list
B)array
C)queue
D)stack

Name: An iterative DFS traversal algorithm uses a(n)______. A)list B)array C)queue D)stack
Brand: Quizplus
Rating: 4.8 (37 reviews)

Question

Quizplus · Accepted Answer

An iterative DFS traversal algorithm uses a stack to keep track of the nodes visited and their neighbors. Therefore, the best choice is a stack (choice D). Choices A, B, and C are not suitable for this purpose.

An Iterative DFS Traversal Algorithm Uses A(n)______