Computer Science, asked by makdh1200, 8 months ago

10
20
21 22 23
Q.20 of 67
Which data structure conveniently used to
implement BFS?
Options​

Answers

Answered by mohansah986
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