---
title: "#inorder articles | Hashnode"
description: "Explore 5 articles tagged #inorder on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/inorder"
---

Tag

# #inorder

5 posts · 0 followers

[Chetan Datta](https://hashnode.com/@chetan77) · [Jul 26, 2025](https://hashnode.com/posts/morris-binary-tree-traversal/68851ed1f0d2cc5ffa0fda37)

### [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,...

2 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/morris-binary-tree-traversal?utm_source=hashnode&utm_medium=feed)

[Aman Pratap Singh](https://hashnode.com/@amanps12) · [Dec 1, 2024](https://hashnode.com/posts/know-about-binary-search-tree/674c0474d7c6dbb9cdac8362)

### [Know About Binary Search Tree](https://amanps12.hashnode.dev/know-about-binary-search-tree?utm_source=hashnode&utm_medium=feed)

Binary Search Trees (BSTs) are a specialized form of binary trees designed to optimize the searching process.

19 min read · [amanps12.hashnode.dev](https://amanps12.hashnode.dev/know-about-binary-search-tree?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Sep 22, 2024](https://hashnode.com/posts/implementing-dfs-using-a-stack/66f05060719c3a33ced9207b)

### [Implementing DFS Using a Stack](https://chetan77.hashnode.dev/implementing-dfs-using-a-stack?utm_source=hashnode&utm_medium=feed)

Here we illustrates the implementation of DFS iteratively using stacks. For the recursive implementation of DFS refere this article. Preorder Traversal Problem Given the root of a binary tree, return the preorder traversal of its nodes' values. (link...

7 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/implementing-dfs-using-a-stack?utm_source=hashnode&utm_medium=feed)

[Chetan Datta](https://hashnode.com/@chetan77) · [Sep 21, 2024](https://hashnode.com/posts/binary-trees-types-bfs-dfs/66eeb7b6aa0869f570b2b7ae)

### [Binary Trees | Types | BFS | DFS](https://chetan77.hashnode.dev/binary-trees-types-bfs-dfs?utm_source=hashnode&utm_medium=feed)

Introduction Arrays and linked lists are flat structures, whereas a tree is a hierarchical structure. If a tree has only 2 children, then it is called a binary tree. Terminology Root: The head of the tree is called the root node. Leaf node: A n...

6 min read · [chetan77.hashnode.dev](https://chetan77.hashnode.dev/binary-trees-types-bfs-dfs?utm_source=hashnode&utm_medium=feed)

[Han](https://hashnode.com/@EunHaSu) · [May 2, 2023](https://hashnode.com/posts/mastering-graphs-and-trees-essential-concepts-and-traversal-techniques/6451675477429f4bc0929640)

### [Mastering Graphs and Trees: Essential Concepts and Traversal Techniques](https://eunhanlee.hashnode.dev/mastering-graphs-and-trees-essential-concepts-and-traversal-techniques?utm_source=hashnode&utm_medium=feed)

preorder = root left right DFS use stack = inorder= left root right postorder = left right root BFS use queue = print each level Graph Used to represent various real-world scenarios such as social networks, transportation systems, and computer netw...

6 min read · [eunhanlee.hashnode.dev](https://eunhanlee.hashnode.dev/mastering-graphs-and-trees-essential-concepts-and-traversal-techniques?utm_source=hashnode&utm_medium=feed)
