Want to join our mediation workshop that helps you to study better?

The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we help you to solve your academic and programming questions fast.
In eduladder you can Ask,Answer,Listen,Earn and Download Questions and Question papers.
Watch related videos of your favorite subject.
Connect with students from different parts of the world.
Apply or Post Jobs, Courses ,Internships and Volunteering opportunity. For FREE
See Our team
Wondering how we keep quality?
Got unsolved questions?

Data-StructuresDS-10CS35-->View question

## Which data structures are used for BFS and DFS of a graph?

Interview preparation question on data Structures.This are the main questions which can be used while preparing for interviews on computer science.The question is about which data structures are used for BFS and DFS of a graph?

Asked On2019-08-17 03:56:38 by:Annaliya

Taged users:
komaleduAlfaqshubhamrdardapranaymasaneAnirudhimakkiLupiNpcycocoderrathinlz04Swathigowda

Likes:
Annaliya

Dislikes:
Be first to dislike this question
Talk about this  Like  Dislike
Answers

Breadth First Search (BFS) and Depth First Search (DFS) are two different way of searching through data structures. BFS and DFS are algorithms that are primarily used for traversing or searching tree or graph data structures. DFS uses stack to search through the data structures, whereas BFS uses queue.

BFS is fairly simple to use as it doesn't need any data structures. It typically starts at the tree root or some arbitrary node of a graph, which is referred to as a 'search key'. It then explores the neighbor nodes first, before moving to the next level neighbors.

DFS is closely related to preorder traversal of a tree, which means that it first searches each node before its children. It starts searching at the tree root or some arbitrary node of a graph and explores as far as possible along each branch before backtracking and trying another route.

Answerd on:2019-09-03 Answerd By:Ananth

Likes:
|Ananth

Dislikes:
Be first to dislike this answer
Talk about this  Like  Dislike

### Watch more videos from this user Here

Learn how to upload a video over here

Breadth First Search (BFS) and Depth First Search (DFS) are two different way of searching through data structures. BFS and DFS are algorithms that are primarily used for traversing or searching tree or graph data structures. DFS uses stack to search through the data structures, whereas BFS uses queue.
Answerd on:2019-08-20 Answerd By:shubhamrdarda

Likes:
|shubhamrdarda

Dislikes:
Be first to dislike this answer
Talk about this  Like  Dislike

### Watch more videos from this user Here

Learn how to upload a video over here

Lets together make the web is a better place

We made eduladder by keeping the ideology of building a supermarket of all the educational material available under one roof. We are doing it with the help of individual contributors like you, interns and employees. So the resources you are looking for can be easily available and accessible also with the freedom of remix reuse and reshare our content under the terms of creative commons license with attribution required close.

You can also contribute to our vision of "Helping student to pass any exams" with these.
Answer a question: You can answer the questions not yet answered in eduladder.How to answer a question
Career: Work or do your internship with us.Work with us
Create a video: You can teach anything and everything each video should be less than five minutes should cover the idea less than five min.How to upload a video on eduladder