Mark As Completed Discussion
Home > Data Structures and Algorithms 🚀 > Climb Some Trees > BFS vs. DFS: Understanding Breadth First Search & Depth First Search

When To Use BFS

Here are a few scenarios and pointers on when to prefer BFS over DFS:

  • When you need to find the shortest path between any two nodes in an unweighted graph.
  • If you're solving a problem, and know a solution is not far from the root of the tree, BFS will likely get you there faster.
  • If the tree is very deep, DFS with heuristics might be faster.

Programming Categories

  • Basic Arrays Interview Questions
  • Binary Search Trees Interview Questions
  • Dynamic Programming Interview Questions
  • Easy Strings Interview Questions
  • Frontend Interview Questions
  • Graphs Interview Questions
  • Hard Arrays Interview Questions
  • Hard Strings Interview Questions
  • Hash Maps Interview Questions
  • Linked Lists Interview Questions
  • Medium Arrays Interview Questions
  • Queues Interview Questions
  • Recursion Interview Questions
  • Sorting Interview Questions
  • Stacks Interview Questions
  • Systems Design Interview Questions
  • Trees Interview Questions

    • Popular Lessons

  • All Courses, Lessons, and Challenges
  • Data Structures Cheat Sheet
  • Free Coding Videos
  • Bit Manipulation Interview Questions
  • Javascript Interview Questions
  • Python Interview Questions
  • Java Interview Questions
  • SQL Interview Questions
  • QA and Testing Interview Questions
  • Data Engineering Interview Questions
  • Data Science Interview Questions
  • Blockchain Interview Questions
  • Dictionaries and Key-Value Stores
  • Optimization and Performance Tuning
  • Recursive Algorithms and Backtracking
  • [Datastore Case Study] Hadoop Distributed File System Whitepaper Summary and Architecture
  • Spring Boot Interview Questions