feat: Add Morris In-Order Traversal to BinaryTreeTraversal #627
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
- Implemented `morris_in_order_traversal` method in the C++ backend. - Exposed the method to Python via `PyMethodDef`. - Added unit tests for Morris Traversal in the test suite. - Verified compatibility with both Python and C++ backends.
czgdp1807
requested changes
Mar 11, 2025
| predecessor_node->right = node; | ||
| current = PyLong_AsLong(current_node->left); | ||
| } else { | ||
| // Revert the changes made to the tree |
There was a problem hiding this comment.
Add a test to make sure that the tree as it is after performing Morris in order traversal.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description
This PR adds the Morris In-Order Traversal algorithm to the
BinaryTreeTraversalclass. Morris Traversal is a space-efficient algorithm for performing in-order traversal of a binary tree without using recursion or a stack. It achieves O(1) space complexity by temporarily modifying the tree structure using threaded binary trees.Changes
C++ Backend:
morris_in_order_traversalmethod in the C++ backend.PyMethodDef.Python Binding:
morris_in_order_traversalmethod.Unit Tests: