Data Structures | Misc | Question 6
The most appropriate matching for the following pairs
X: depth first search 1: heap
Y: breadth-first search 2: queue
Z: sorting 3: stack
is (GATE CS 2000):
(A) X—1 Y—2 Z-3
(B) X—3 Y—1 Z-2
(C) X—3 Y—2 Z-1
(D) X—2 Y—3 Z-1
Answer: (C)
Explanation: Stack is used for Depth first Search
Queue is used for Breadth First Search
Heap is used for sorting
Quiz of this Question
Last Updated :
28 Jun, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...