Vertical Order Traversal in a tree added #2585
Merged
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
|
Is there any problem in my code or something , it's my first time contributing in any repo so I wanted to know if I made any mistakes. |
siriak
requested changes
Oct 14, 2021
Removed the Node class and used the existing binary tree class , also instead of printing the values a sequence in arraylist of ans is returned.
|
The changes asked are done . |
siriak
approved these changes
Oct 14, 2021
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
In DataStructure folder under tree subcategory vertical order traversal added.
Vertical order traversal in a tree prints the tree from left to right and top to bottom in vertical columns , the codes not only implements it but also explains the process and what data structure is used for what purpose .