MorrisPreOrder Traversal

[mkhuzaima]

Detailed description

Morris Traversal is an algorithm for Binary tree traversal in O(1) space.

https://en.wikipedia.org/wiki/Tree_traversal

Context

It can help users to understand how morris traversal works, and how it can be used for preorder traversal.Morris

Possible implementation

It is implemented with threaded traversal. i.e., changing tree internally during traversal and restoring it to original state.

Additional information

No response

[github-actions]

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!