3902. Zigzag Level Sum of Binary Tree
TreeBreadth-First SearchBinary Tree
Hints
Hint 1
Use level-order traversal (
BFS) to process the tree level by levelHint 2
Maintain a list (or queue) of nodes for the current level
Hint 3
Alternate traversal direction using a flag (odd level vs even level)
Preparing judge…