10
20
21 22 23
Q.20 of 67
Which data structure conveniently used to
implement BFS?
Options
Answers
Answered by
0
Answer:
b
Explanation: Queue is the most convenient data structure, but memory used to store nodes can be reduced by using circular queues.
Similar questions
Chemistry,
4 months ago
English,
8 months ago
Social Sciences,
11 months ago
Biology,
11 months ago
Math,
11 months ago