Binary Tree Level Order Traversal Using BFS

bytedance Given a binary tree, use the breadth-first search algorithm to traverse the tree and return a list of the node values at each level. Please provide the implementation code. Example Input 1 2 3 4 5 6 7