René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"[FEATURE]: Add Morris Traversal Algorithm","articleBody":"### Motivation\n\n\n\u003e ### Describe your change:\n\u003e\n\u003e *  [x] Add an algorithm?\n\u003e *  [ ] Fix a bug or typo in an existing algorithm?\n\u003e *  [ ] Documentation change?\n\u003e\n\u003e ### Checklist:\n\u003e\n\u003e *  [x] I have read [[CONTRIBUTING.md](https://github.com/TheAlgorithms/Javascript/blob/master/CONTRIBUTING.md)](https://github.com/TheAlgorithms/Javascript/blob/master/CONTRIBUTING.md).\n\u003e *  [x] This pull request is all my own work -- I have not plagiarized.\n\u003e *  [x] I know that pull requests will not be merged if they fail the automated tests.\n\u003e *  [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.\n\u003e *  [x] All new JavaScript files are placed inside an existing directory.\n\u003e *  [x] All filenames should use the UpperCamelCase (PascalCase) style. There should be no spaces in filenames.\n\u003e   **Example:** `UserProfile.js` is allowed but `userprofile.js`,`Userprofile.js`,`user-Profile.js`,`userProfile.js` are not.\n\u003e *  [x] All new algorithms have a URL in their comments that points to Wikipedia or another similar explanation.\n\u003e   **Example:** [[Morris Traversal - Wikipedia](https://en.wikipedia.org/wiki/Threaded_binary_tree#Morris_traversal)](https://en.wikipedia.org/wiki/Threaded_binary_tree#Morris_traversal)\n\u003e *  [ ] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.\n\u003e *  [ ] closes\n\n### Examples\n\n            7\n           / \\\n          5   8\n         / \\\n        3   6\n             \\\n              9\n\n\nTraversal order (Inorder: Left → Root → Right):\nStep 1: Visit leftmost node → 3\nStep 2: Back to parent → 5\nStep 3: Move to right subtree → 6\nStep 4: Right child of 6 → 9\nStep 5: Back to root → 7\nStep 6: Right child of root → 8\n\nFinal output sequence:\n3, 5, 6, 9, 7, 8\n\n\n### Possible workarounds\n\n\u003chtml\u003e\n\u003cbody\u003e\n\u003c!--StartFragment--\u003e\u003ch3 data-start=\"648\" data-end=\"706\"\u003e\u003cstrong data-start=\"652\" data-end=\"706\"\u003ePossible Workarounds – Conceptual Illustration\u003c/strong\u003e\u003c/h3\u003e\n\u003cdiv class=\"_tableContainer_1rjym_1\"\u003e\u003cdiv tabindex=\"-1\" class=\"group _tableWrapper_1rjym_13 flex w-fit flex-col-reverse\"\u003e\nMethod | Space Complexity | Notes\n-- | -- | --\nRecursive Inorder Traversal | O(h) | Uses call stack; simple but not O(1)\nIterative Inorder with Stack | O(h) | Explicit stack; simulates recursion\nThreaded Binary Tree | O(1) | Permanently modifies tree pointers for threads\n\n\u003c/div\u003e\u003c/div\u003e\n\u003cp data-start=\"1211\" data-end=\"1232\"\u003e\u003cstrong data-start=\"1211\" data-end=\"1230\"\u003eVisual analogy:\u003c/strong\u003e\u003c/p\u003e\n\u003cul data-start=\"1233\" data-end=\"1515\"\u003e\n\u003cli data-start=\"1233\" data-end=\"1319\"\u003e\n\u003cp data-start=\"1235\" data-end=\"1319\"\u003e\u003cstrong data-start=\"1235\" data-end=\"1256\"\u003eRecursive / Stack\u003c/strong\u003e → climbing stairs with a backpack (stack grows with height).\u003c/p\u003e\n\u003c/li\u003e\n\u003cli data-start=\"1320\" data-end=\"1414\"\u003e\n\u003cp data-start=\"1322\" data-end=\"1414\"\u003e\u003cstrong data-start=\"1322\" data-end=\"1342\"\u003eMorris Traversal\u003c/strong\u003e → climbing stairs using only your hands on rails (no extra backpack).\u003c/p\u003e\n\u003c/li\u003e\n\u003cli data-start=\"1415\" data-end=\"1515\"\u003e\n\u003cp data-start=\"1417\" data-end=\"1515\"\u003e\u003cstrong data-start=\"1417\" data-end=\"1434\"\u003eThreaded Tree\u003c/strong\u003e → installing permanent rails on stairs (extra setup, but efficient traversal).\u003c/p\u003e\u003c/li\u003e\u003c/ul\u003e\u003c!--EndFragment--\u003e\n\u003c/body\u003e\n\u003c/html\u003e\n\n### Additional information\n\nAdditional Information – Illustration\n\nKey Points about Morris Traversal:\n\nMemory Efficient: Uses O(1) extra space, unlike recursion or stack.\n\nInorder Traversal: Left → Root → Right.\n\nTemporary Tree Modification: Creates “threads” to revisit nodes.\n\nFuture Extension: Preorder Morris Traversal is possible with minor changes.\n\nReference: Wikipedia → Threaded binary tree / Morris Traversal.\n\nConceptual Analogy:\n\nNormal Traversal (Stack/Recursion) → Carrying bags for each level\nMorris Traversal → Using built-in tree connections temporarily, no bags\nThreaded Tree → Installing permanent pathways for future traversals","author":{"url":"https://github.com/aniket866","@type":"Person","name":"aniket866"},"datePublished":"2025-09-29T20:54:10.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":2},"url":"https://github.com/1806/JavaScript/issues/1806"}