The data structure required for Breadth First Traversal on a graph is?

Related MCQs

• Graph traversal is different from a tree traversal, because
• Which data structure is used in breadth first search of a graph to hold nodes?
• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be
• To perform level-order traversal on a binary tree, which of the following data structure will be required?
• Which of the following graph traversals closely imitates level order traversal of a binary tree?
• Breadth First search is used in____________.
• 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?
• Which of the following data structure is linear data structure?