Neoalgo: Add Post-Order Tree Traversal

Created on 27 Jun 2020  路  9Comments  路  Source: TesseractCoding/NeoAlgo

Algorithm:

Post-Order Tree Traversal

DS:

Trees

Languages Supported:

  • C [ Assigned to @gaushikmr ]
  • C++ [ Assigned to @chaitanya003 ]
  • C#
  • Java [ Assigned to @chaitanya003 ]
  • Javascript
  • Python [ Assigned to @GSNCodes ]
C-Plus-Plus C-Sharp Java JavaScript easy enhancement good first issue no-issue-activity

All 9 comments

Could I do this in C++ and Java ?
@HarshCasper

I have assigned you the Issue @chaitanya003

Please follow the general guidelines:

  • Make a Branch off your Master and work on that.
  • Make a proper README of how your Script works and what all libraries and modules you have used.
  • Add Proper Comments and focus on Clean Code, in practice.
  • Also reference this Issue in your PR so that it becomes easy for us to review.

Ready to implement this in Python!
@HarshCasper

Can u assign me to do this in C and Python.

I have assigned you the Issue @GSNCodes and @gaushikmr in your preferred languages 馃檶

Please follow the general guidelines:

  • Make a Branch off your Master and work on that.
  • Make a proper README of how your Script works and what all libraries and modules you have used.
  • Add Proper Comments and focus on Clean Code, in practice.
  • Also reference this Issue in your PR so that it becomes easy for us to review.

@HarshCasper
Can i do this in Java ?

ok

I would like to work on this issue in C#

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Telegram or ping one of the reviewers. Thank you for your contributions!

Was this page helpful?
0 / 5 - 0 ratings

Related issues

SayaniG371 picture SayaniG371  路  9Comments

sharur7 picture sharur7  路  9Comments

sukritidawar picture sukritidawar  路  7Comments

ashwanisng picture ashwanisng  路  7Comments

TEJASWI-TEJASWI picture TEJASWI-TEJASWI  路  9Comments