Explain breadth-first search and disadvantages of it.
From the root node:
- explores the neighbor nodes first
- moves towards the next level neighbors.
Implemented using FIFO queue data structure
Disadvantage - each level of nodes is saved for creating next one = consumes a lot of memory space and time