---
title: "Discussion on \"Morris Inorder Traversal\" | Hashnode"
description: "Discussion on \"Morris Inorder Traversal\". So one of the most fundamental data structures in trees are Binary Search Trees. But when we talk about Binary trees a lot of folks tend to get confused.\nThe difference btw BST and Binary trees is that in Binary search trees, every node to the left o..."
url: "https://hashnode.com/posts/morris-inorder-traversal/64fc848fc2f9996b1d8f71e9"
---

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

Discussion

# [Morris Inorder Traversal](https://ctangent.hashnode.dev/morris-inorder-traversal?utm_source=hashnode&utm_medium=feed)

So one of the most fundamental data structures in trees are Binary Search Trees. But when we talk about Binary trees a lot of folks tend to get confused. The difference btw BST and Binary trees is that in Binary search trees, every node to the left o...

Sep 9, 2023 · 2 min read · ctangent.hashnode.dev  
Read the article

-   [#treetraversals](https://hashnode.com/tag/treetraversals)
-   [#data-structure-and-algorithms](https://hashnode.com/tag/data-structure-and-algorithms)
-   [#binary-trees](https://hashnode.com/tag/binary-trees)

## Written by

[Ctangent](https://hashnode.com/@ctangent)

@ctangent

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

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
