[Solved] Which data structure is used in breadth first search of a graph to hold nodes?

Q.	Which data structure is used in breadth first search of a graph to hold nodes?
A.	stack
B.	queue
C.	tree
D.	array
Answer» B. queue

View all MCQs in: Data Structure (DS)

Discussion

Related Multiple Choice Questions

A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
Which of the following data structure is not linear data structure?
A graph is a tree if and only if graph is
Which data structure allows deleting data elements from and inserting at rear?
Which of the following data structure can’t store the non-homogeneous data elements?
Which data structure allows deleting data elements from front and inserting at rear?
Which of the following data structure can’t store the non-homogeneous data elements?
In ___ Data Structure data can be processed one by one sequentially

Help us improve!

We want to make our service better for you. Please take a moment to fill out our survey.