TIFR CSE 2022 | Part B | Question: 1

Question

Which data structure is commonly used to implement breadth first search in a graph?

• A. A queue
• B. A stack
• C. A heap
• D. A hash table
• E. A splay tree

Answer 1

We use queue for Breadth first search because

we need to store the nodes which see from the current node ( neighbouring nodes ) and need to be traversed those nodes in that order ( i.e we visit the nodes in breadth wise manner )

Since Queue is first in first out ( FIFO ) Data structure this will satisfy the requirements that we need