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

Related MCQs

• The data structure required for Breadth First Traversal on a graph is?
• Breadth First search is used in____________.
• A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes.
• ____________ data structure is used to implement Depth First search.
• Which of the following is useful in traversing a given graph by Breath first search?
• 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.
• In a full binary tree if number of internal nodes is I, then number of nodes N are?
• The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
• 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?