How can I remember which data structures are used by DFS and BFS?

stack queue depth-first-search breadth-first-search
captcadaver picture captcadaver · Oct 14, 2010 · Viewed 67.7k times · Source

I always mix up whether I use a stack or a queue for DFS or BFS. Can someone please provide some intuition about how to remember which algorithm uses which data structure?

Answer

Sai Kumar Battinoju picture Sai Kumar Battinoju · Sep 24, 2015

Queue can be generally thought as horizontal in structure i.e, breadth/width can be attributed to it - BFS, whereas

Stack is visualized as a vertical structure and hence has depth - DFS.

Related questions

How do you implement a Stack and a Queue in JavaScript?

What is the best way to implement a Stack and a Queue in JavaScript? I'm looking to do the shunting-yard algorithm and I'm going to need these data-structures.

Read More
How to implement a queue using two stacks?

Suppose we have two stacks and no other temporary variable. Is to possible to "construct" a queue data structure using only the two stacks?

Read More
what is the basic difference between stack and queue?

What is the basic difference between stack and queue?? Please help me i am unable to find the difference. How do you differentiate a stack and a queue? I searched for the answer in various links and found this answer.. …

Read More