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

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

Which data structure is used in breadth first search of a graph to hold nodes?a.Arrayb.Queuec.Treed.Stack

Which data structure is typically used for implementing Breadth-First Search (BFS) in graphs?StackQueueHeapLinked list

In a depth-first search (DFS) traversal of a graph, which data structure is used to store visited vertices?StackQueueHeapHash table

______data structure is most suitable for implementing a stack Array Linked list Tree Graph