edited by
687 views

2 Answers

3 votes
3 votes
option D is correct.

Queue is used in Breadth First Search

Stack is used in Depth First Search.
Answer:

Related questions

1 votes
1 votes
2 answers
1
admin asked Apr 1, 2020
3,643 views
If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?$O(n),O(n)$$O(n),O(1)$$O(1),O(n)$$O(1),O(1)$
2 votes
2 votes
1 answer
2
admin asked Apr 1, 2020
1,039 views
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$$2^{h-1} ...
2 votes
2 votes
2 answers
3
admin asked Apr 1, 2020
980 views
The number of possible binary trees with $4$ nodes is$12$$13$$14$$15$
0 votes
0 votes
0 answers
4
admin asked Aug 28, 2020
391 views
A solution for the differential equation $x’(t) + 2x(t) = \delta(t)$ with initial condition $x(\overline{0}) = 0$$e^{-2t}u(t)$$e^{2t}u(t)$$e^{-t}u(t)$$e^{t}u(t)$