Uninformed Search - Bidirectional Search

[@bhim443]

very detailed and good explanation - thank you

[@haganlife]

Unweighted BFS is guaranteed to find shortest path at each level. Therefore it is NOT necessary to store previous nodes in memory. At each level just replace the previous queue with next queue.

[@olashoretijesunimi6039]

Thanks so much for this video. Well delivered!!!

[@SuperWhatusername]

Wonderful explanation, Thanks !!!

[@hibasalman8462]

Thank you :)

[@anjalichoudhary5467]

Thanks this was helpful :)