The Breadth First Search traversal of a graph will result into?
(a) Linked List
(b) Tree
(c) Graph with back edges
(d) Arrays
The question was posed to me by my school teacher while I was bunking the class.
My question is taken from Breadth First Search in section Graph Search of Data Structures & Algorithms II