Solved BFS 1 problems

[aahiawasthee]

No description provided.

[super30admin]

• The student has demonstrated a good understanding of both DFS and BFS approaches, which is commendable.
• The commented-out BFS code suggests the student considered both methods, which is excellent practice.
• The DFS approach is a creative alternative, though it's worth noting that BFS is more commonly used for level-order traversal due to its natural alignment with the problem's requirements.
• The code could benefit from a brief explanation of why DFS works for level-order traversal, as it might not be immediately obvious to all readers.
• The space complexity comment for the DFS approach should reflect O(h) for the recursion stack, not O(1), as the current comment is misleading.