Skip to content
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.

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

Inorder, preorder, postorder traversals of tree in any language. #101

Open
Anuja-19 opened this issue Oct 4, 2020 · 7 comments
Open

Inorder, preorder, postorder traversals of tree in any language. #101

Anuja-19 opened this issue Oct 4, 2020 · 7 comments
Assignees
Labels

Comments

@Anuja-19
Copy link
Owner

Anuja-19 commented Oct 4, 2020

Please check the readme file.
Comment the language you'll be using for the issue to be assigned to you.
Mention the issue number in your PR.

@vishkrish200
Copy link

Hey,
Can I take up this issue in java?

@ghost
Copy link

ghost commented Oct 4, 2020

Hello I want to take this issue in c++ Please assign it to me.

@amal-majunu
Copy link
Contributor

Hi, Can I take up this issue in C?

@Anuja-19
Copy link
Owner Author

Anuja-19 commented Oct 4, 2020

@vishkrish200 @abhstract @amal-majunu Assigning you all . Good luck!

@quocanh261997
Copy link
Contributor

Can I take this issue and implement it in Python/JavaScript?

@Anuja-19
Copy link
Owner Author

Anuja-19 commented Oct 5, 2020

Sure, @quocanh261997 Assigning you

@ameya-shahu
Copy link

Can I do this in kotlin?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

5 participants