Skip to content

Solution for n-ary-tree-level-order-traversal (DFS) #13

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Solution for n-ary-tree-level-order-traversal (DFS) #13

wants to merge 2 commits into from

Conversation

codebymani
Copy link

@codebymani codebymani commented Oct 11, 2019 •
edited
Loading

Issue #11

@aayush26
Copy link
Owner

Thanks for sending out PR.
Since you have implemented with dfs, please follow the detailed instructions on how to contribute to this repo:
https://github.com/aayush26/leetcode/blob/master/README.md#how-to-contribute

Please send out new revision accordingly.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@codebymani @aayush26