Create 0103-binary-tree-zigzag-level-order-traversal.cpp #2770
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
File(s) Modified: 0103-binary-tree-zigzag-level-order-traversal.cpp
0637-average-of-levels-in-binary-tree.cpp (Problem not included in Readme list)
0116-populating-next-right-pointers-in-each-node.cpp
0117-populating-next-right-pointers-in-each-node-ii.cpp (Problem not included in Readme list)
Language(s) Used: C++
Submission URL: https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/submissions/1014003997/
https://leetcode.com/problems/average-of-levels-in-binary-tree/submissions/1014025523/
https://leetcode.com/problems/populating-next-right-pointers-in-each-node/submissions/1014050661/
https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/submissions/1014120858/
Important
Please make sure the file name is lowercase and a duplicate file does not already exist before merging.