Skip to content
This repository has been archived by the owner on Oct 6, 2021. It is now read-only.

Binary Tree Recursive Traversals ( Inorder , Preorder , Postorder ) #132

Open
tm2k23 opened this issue Oct 1, 2021 · 9 comments
Open

Binary Tree Recursive Traversals ( Inorder , Preorder , Postorder ) #132

tm2k23 opened this issue Oct 1, 2021 · 9 comments

Comments

@tm2k23
Copy link
Contributor

tm2k23 commented Oct 1, 2021

🚀 Feature

I would like to add all 3 traversals of the binary tree recursively

Have you read the Contribution Guidelines?

Yes

Assignees

(Do not make changes in this section until asked to do so)
C - @Mudit018
C# -
C++ - @tm2k23
Go -
Java - @jfernancordova
Javascript - @prasanna16-12
Kotlin -
Python - @prakharshukla48

@tm2k23
Copy link
Contributor Author

tm2k23 commented Oct 1, 2021

@manan025 Please assign C++ to me

@Mudit018
Copy link
Contributor

Mudit018 commented Oct 1, 2021

@manan025 Please assign C to me

@prakharshukla48
Copy link

Please assign python to me

@manan025
Copy link
Owner

manan025 commented Oct 1, 2021

C - @Mudit018
C++ - @tm2k23
Python - @prakharshukla48
assigned

@prasanna16-12
Copy link

assign me for javascript.

@jfernancordova
Copy link
Contributor

@manan025 please assign Java to me.

@manan025
Copy link
Owner

manan025 commented Oct 2, 2021

@prasanna16-12 - JS
@jfernancordova - Java
assigned

@jfernancordova
Copy link
Contributor

@prasanna16-12 - JS @jfernancordova - Java assigned

Thank you @manan025, also, I did this PR.

@sumanthtatipamula
Copy link
Contributor

@manan025 I would like to contribute in kotlin

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

No branches or pull requests

7 participants