0
[Added later – this question is not part of the original paper]
Which data structure is used to implement Breadth-First Search (BFS) of a graph?
- AStack
- BQueue
- CHeap
- DTree
Correct answer: B
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!