Algo-Phantoms / Algo-Tree

Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.

MIT License

363 stars 619 forks source link

N-ary Tree Inorder traversal #694

Open 08Gunjan opened 3 years ago

08Gunjan commented 3 years ago

500

I would like to contribute in your Project by working on Tree (Inorder ) (N-ary Tree ) Problems using Recursive Approach in JAVA .

My Approach is Optimize yet Easy to understand .
Single Line Comments makes it easy to read.
Required Test Case are added at the end.
Can make it More Explanatory using the Image Please assign me this issue under the label GSSOC21 , Looking Forward To your Response @tarun26091999

Aarti002 commented 3 years ago

hello @tarun26091999 i would like to do it in python under gssoc'21 so, please assign this to me Thank you!

08Gunjan commented 3 years ago

@tarun26091999 Could you please tell the Duration to make this PR

khusheekapoor commented 3 years ago

Hello! I am a GSSoC'21 Participant. I would like to work on this issue. Would be highly obliged if you could assign it to me. I will be using Java. Thanks!

Nikitha2309 commented 3 years ago

Proposal

Hello, I am a GSSoc'21 participant. Having a good interest knowledge of working with trees, I request you to assign this issue to me.

Starting from the root, each node's data should be stored in a vector (or printed according to the requirement) and then all child nodes of this particular node are queued for the successive visits , Finally after each node visit , it will be popped out from the queue.

Eligibility

I have already worked on algorithms related to the tree
Hence I can provide an easy, understandable algorithm with quality code, highly understandable comments and easy as well as corner test cases.

Request

Hence I request project admin to assign this issue to me under the label of GSSoC'21. Looking forward to this issue getting assigned to me and work on it, Thank you.

hw0105 commented 3 years ago

Hi, I am a participant of GSSOC'21 and I would like to contribute to this issue in cpp.

tarun26091999 commented 3 years ago

Proposal

Hello, I am a GSSoc'21 participant. Having a good interest knowledge of working with trees, I request you to assign this issue to me.

Starting from the root, each node's data should be stored in a vector (or printed according to the requirement) and then all child nodes of this particular node are queued for the successive visits , Finally after each node visit , it will be popped out from the queue.

Eligibility

I have already worked on algorithms related to the tree

Hence I can provide an easy, understandable algorithm with quality code, highly understandable comments and easy as well as corner test cases.

Request

Hence I request project admin to assign this issue to me under the label of GSSoC'21. Looking forward to this issue getting assigned to me and work on it, Thank you.

always specify the language you want to work in.

Nikitha2309 commented 3 years ago

@tarun26091999 , I can give the required solution in C , C++ as well as Python . So can u assign this issue to me 🙂?