A. Level wise printing of tree. which is use in BFS and BFS use queue data structure for level ordering or Level wise printing so it is correct option
B. Implementation of priority queues. does not make sense here
C. Function call implementation here stack data structure use
D. Depth first search in a graph. stack data structure use