BFS-1 solutions

[kalyan-ng22]

No description provided.

[super30admin]

• The student's solution is well-implemented and follows best practices. The use of a queue for BFS and maintaining a size variable for each level is correctly done.
• The comments are helpful and explain the approach clearly.
• One minor improvement could be to handle the case where the root is null at the beginning more elegantly, but the current implementation is correct.
• The solution is efficient and matches the reference solution in terms of time and space complexity.