Added Zigzag Traversal of Binary Tree in C++ #8973
Open
+146
−0
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Description 📜
This Pull Request adds Zigzag (Spiral) Traversal of a Binary Tree implemented in C++ with a clear explanation, algorithm, and complexity analysis.
The contribution is intended to help learners understand an important variation of level-order traversal used in DSA and competitive programming.
Fixes # (Not applicable)
Type of change 📝
Documentation (Content Creation in the form of codes or tutorials)
Domain of Contribution 📊
C/CPP
DSA
Competitive Programming
Checklist ✅
I follow Contributing Guidelines
& Code of conduct
of this project.
I have performed a self-review of my own code or work.
My changes generate no new warnings.
I'm GWOC'21 contributor