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

Related Questions

• Graph traversal is different from a tree traversal, because
• 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
• Which of the following graph traversals closely imitates level order traversal of a binary tree?
• Breadth First search is used in____________.
• Which of the following data structure is linear data structure?
• If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
• What is the traversal strategy used in the binary tree?
• How many orders of traversal are applicable to a binary tree (In General)? 3
• For the tree below, write the pre-order traversal.