The Depth First Search traversal of a graph will result into?
(a) Linked List
(b) Tree
(c) Graph with back edges
(d) Array
I have been asked this question in final exam.
I want to ask this question from Depth First Search in chapter Graph Search of Data Structures & Algorithms II