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

Add Morris Inorder Traversal for a Binary Tree inside the Doc #135

Open
2 tasks done
sid-am-ahd935 opened this issue Jul 23, 2022 · 2 comments
Open
2 tasks done

Add Morris Inorder Traversal for a Binary Tree inside the Doc #135

sid-am-ahd935 opened this issue Jul 23, 2022 · 2 comments
Assignees
@sid-am-ahd935
Labels
HSOC22-Level-2 HSoC'22 medium level

Comments

@sid-am-ahd935
Copy link
Contributor

Description

Recursively, anyone can traverse the binary tree but it takes O(N) time and O(N) space [function call stack]. To reduce the space complexity, Morris Traversal is used.

Programming language

  • C++
  • Python

Are you contributing under any open-source program ?

Hackclub RAIT Summer of Code
@sid-am-ahd935
Copy link
Contributor Author

Hi @Chaitalishetty can you please assign this issue to me?

@Chaitalishetty
Copy link
Member

@sid-am-ahd935 Assigning you this issue. Happy Coding !

@Chaitalishetty Chaitalishetty added the HSOC22-Level-2 HSoC'22 medium level label Jul 23, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@sid-am-ahd935 sid-am-ahd935

Labels
HSOC22-Level-2 HSoC'22 medium level
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@Chaitalishetty @sid-am-ahd935