____________ data structure is used to implement Depth First search.

Related Questions

• A self – balancing binary search tree can be used to implement
• Which of the following data structure is linear data structure?
• Breadth First search is used in____________.
• New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
• Which data structure allows deleting data elements from front and inserting at rear?
• The data structure required for Breadth First Traversal on a graph is?
• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• Which of the following is useful in traversing a given graph by Breath first search?
• Which data structure is used for implementing recursion?
• Which of the following is the most widely used external memory data structure?