Multiple choice

Disadvantage of BFS over DFS is

  1. it requires more memory

  2. it requires less memory

  3. it is inefficient

  4. none of the above
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Breadth-First Search (BFS) must store all nodes at the current depth level in the queue, which leads to exponential memory usage as the search tree grows. Depth-First Search (DFS) only needs to store the current path, making it more memory-efficient.

Keep practicing — related questions