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

Traversals , Height , mirror image and copy of Binary Tree #80

Open
snehalkhandve opened this issue Dec 11, 2019 · 2 comments
Open

Traversals , Height , mirror image and copy of Binary Tree #80

snehalkhandve opened this issue Dec 11, 2019 · 2 comments
Assignees
@snehalkhandve
Labels
easy

Comments

@snehalkhandve
Copy link
Contributor

Many operations can be performed on a given binary tree which are useful in competitive programming problems . I am interested to implement pre-order , post-order and in-order traversal , finding height , mirror image and copy of a binary tree .
@snehalkhandve
Copy link
Contributor Author

Should I start working on it ?

@rishabhgarg25699
Copy link
Owner

@snehalkhandve assigned

@snehalkhandve snehalkhandve mentioned this issue Dec 12, 2019
Merged
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@snehalkhandve snehalkhandve

Labels
easy
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@rishabhgarg25699 @snehalkhandve