---
title: "Discussion on \"Morris Binary Tree Traversal [space - O(1)]\" | Hashnode"
description: "Discussion on \"Morris Binary Tree Traversal [space - O(1)]\". Problem Statement\nGiven the root of a binary tree, return the inorder traversal of its nodes' values. (link)\nExample 1:\nInput: root = [1,null,2,3]\nOutput: [1,3,2]\nExplanation:\n\nExample 2:\nInput: root = [1,2,3,4,5,null,8,null,null,6,7,9]\nOutput: [4,2,..."
url: "https://hashnode.com/posts/morris-binary-tree-traversal/68851ed1f0d2cc5ffa0fda37"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Morris Binary Tree Traversal \[space - O(1)\]](https://chetan77.hashnode.dev/morris-binary-tree-traversal?utm_source=hashnode&utm_medium=feed)

Problem Statement Given the root of a binary tree, return the inorder traversal of its nodes' values. (link) Example 1: Input: root = \[1,null,2,3\] Output: \[1,3,2\] Explanation: Example 2: Input: root = \[1,2,3,4,5,null,8,null,null,6,7,9\] Output: \[4,2,...

Jul 26, 2025 · 2 min read · chetan77.hashnode.dev  
Read the article

-   [#moris-binary-tree-traversal](https://hashnode.com/tag/moris-binary-tree-traversal)
-   [#threaded-binary-tree](https://hashnode.com/tag/threaded-binary-tree)
-   [#o1-space-complexity](https://hashnode.com/tag/o1-space-complexity)
-   [#binarytrees](https://hashnode.com/tag/binarytrees)
-   [#inorder](https://hashnode.com/tag/inorder)
-   [#preorder](https://hashnode.com/tag/preorder)

## Written by

[Chetan Datta](https://hashnode.com/@chetan77)

@chetan77 · Hyderabad, India

  
[View profile](https://hashnode.com/@chetan77)

Software Engineer

I share my learnings here. Thanks for reading.

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
