Home Modern › Forums › ISRO › Which of the following data structure is useful in traversing a given graph by breadth first search? Which of the following data structure is useful in traversing a given graph by breadth first search?
(A) Stack
(B) List
(C) Queue
(D) None of the above.
(A) Stack
(B) List
(C) Queue
(D) None of the above.
nan