Data-Structures-and-Algorithms Implement a function which when given an entry point to a tree, prints its preorder, inorder and post-order traversal.

Implement a function which when given an entry point to a tree, prints its preorder, inorder and post-order traversal.

Open Iltwats opened this issue 4 years ago • 5 comments

Implement a function which when given an entry point to a tree, prints its preorder, inorder and postorder traversal.

Write a sample use of the checker function in the main function of your program. Also, specify the data structure used for the tree.

Hint: Use recursion for succinct code. For the really adventurous, try doing the same iteratively (you will need to use a stack).

Sep 30 '20 14:09 Iltwats

Issue-Label Bot is automatically applying the label feature_request to this issue, with a confidence of 0.99. Please mark this comment with :thumbsup: or :thumbsdown: to give our bot feedback!

Links: app homepage, dashboard and code for this bot.

Sep 30 '20 14:09 issue-label-bot[bot]

I would like to provide my code under hacktoberfest2021 :)

Sep 30 '21 20:09 spyd3r-byte

@spyd3r-byte assigned.

Oct 01 '21 08:10 Iltwats

can you assign me this?

Jan 22 '22 00:01 YuyangHsieh8344

@YuyangHsieh8344 check if not already implemented in language you want to implement, then do it.

Jan 22 '22 08:01 Iltwats

Data-Structures-and-Algorithms Data-Structures-and-Algorithms copied to clipboard

Implement a function which when given an entry point to a tree, prints its preorder, inorder and post-order traversal.

Data-Structures-and-Algorithms
Data-Structures-and-Algorithms copied to clipboard