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.

Sign up for GitHub

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

Jump to bottom

Implement a program that prints preorder, inorder and postorder traversal of a tree #30

Open
yashjakhotiya opened this issue Oct 4, 2019 · 2 comments
Open

Implement a program that prints preorder, inorder and postorder traversal of a tree #30

yashjakhotiya opened this issue Oct 4, 2019 · 2 comments
Labels
hacktoberfest Dedicated to hacktoberfest

Comments

@yashjakhotiya
Copy link
Collaborator

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).
@yashjakhotiya yashjakhotiya added the hacktoberfest Dedicated to hacktoberfest label Oct 4, 2019
@deepaksinghcv
Copy link
Contributor

deepaksinghcv commented Oct 4, 2019 •
edited
Loading

May i work on this issue. Is this repo restricted to ASCI-COEP members?
I will be doing this in Python

@deepaksinghcv
Copy link
Contributor

PR #39

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
hacktoberfest Dedicated to hacktoberfest
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@yashjakhotiya @deepaksinghcv