O(V), BFS requires more space than DFS -E.g: Level wise Traversal, -DFS stands for Depth First Search -It explores a graph by going as deep as possible down one branch before backtracking to ...