here are how many types of graph traversal technique.a)3b)1c)2d)4

Which of them is not belongs as traversal techniques.a)Both Depth first search & Breadth first searchb)Height first searchc)Breadth first searchd)Depth first search

Which of the following data structure is useful in traversing a given graph by breadth first search?a)Queueb)None of the mentionedc)Listd)Stack

Traversal of a graph is different from tree becausea)There can be a loop in graph so we must maintain a visited flag for every vertexb)All of the mentionedc)BFS of a graph uses queue, but a time efficient BFS of a tree is recursived)DFS of a graph uses stack, but inorder traversal of a tree is recursive

Which of the following ways can be used to represent a graph?

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