https://github.com/chanda-abdul/dsa-bfs-dfs

https://github.com/chanda-abdul/dsa-bfs-dfs

Last synced: about 1 month ago
JSON representation

• Host: GitHub
• URL: https://github.com/chanda-abdul/dsa-bfs-dfs
• Owner: Chanda-Abdul
• Created: 2021-03-11T01:51:02.000Z (almost 4 years ago)
• Default Branch: main
• Last Pushed: 2021-03-11T02:15:27.000Z (almost 4 years ago)
• Last Synced: 2024-11-14T02:23:42.882Z (3 months ago)
• Size: 2.93 KB
• Stars: 0
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# DSA-BFS-DFS

## Breadth-First Search (BFS) and Breadth-First Traversal

Breadth-first search (BFS) is a method for exploring a tree or graph. In a BFS, you first explore all the nodes one step away, then all the nodes two steps away, etc.

Breadth-first search is like throwing a stone in the center of a pond. The nodes you explore "ripple out" from the starting point.

#### Advantages:

- A BFS will find the shortest path between the starting point and any other reachable node. A depth-first search will not necessarily find the shortest path.

#### Disadvantages

- A BFS on a binary tree generally requires more memory than a DFS.

## Depth-First Search (DFS) and Depth-First Traversal

Depth-first search (DFS) is a method for exploring a tree or graph. In a DFS, you go as deep as possible down one path before backing up and trying a different one.

Depth-first search is like walking through a corn maze. You explore one path, hit a dead end, and go back and try a different one.

#### Advantages:

- Depth-first search on a binary tree generally requires less memory than breadth-first.

- Depth-first search can be easily implemented with recursion.

#### Disadvantages

- A DFS doesn't necessarily find the shortest path to a node, while breadth-first search does.

#

- Remember that breadth-first uses a queue and depth-first uses a stack 

- Those differences come from whether we visit nodes in the order we see them (first in, first out) or we visit the last-seen node first (last in, first out).

## LeetCode Problems