-
The most appropriate matching for the following pairs is
X. depth first search 1. heap Y. breadth-first search 2. queue Z. sorting 3. stack
-
- X – 1, Y – 2, Z – 3
- X – 3, Y – 1, Z – 2
- X – 3, Y – 2, Z – 1
- X – 2, Y – 3, Z – 1
- X – 1, Y – 2, Z – 3
Correct Option: C
X. depth first search is done in stack.
Y. breadth first search is done in queue
Z. sorting is done in a heap.
