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

Tag

# #treealgorithms

4 posts · 0 followers

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/morris-traversal-in-order-traversal-without-recursion/678208f16dca2f657313e81f)

### [Morris Traversal: In-Order Traversal Without Recursion](https://blogs.arkainfotech.in/morris-traversal-in-order-traversal-without-recursion?utm_source=hashnode&utm_medium=feed)

Learn about Morris Traversal: efficient in-order binary tree traversal without recursion or a stack, achieving O(n) time and O(1) space complexity

6 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/morris-traversal-in-order-traversal-without-recursion?utm_source=hashnode&utm_medium=feed)

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/centroid-decomposition-for-tree-algorithms-a-comprehensive-guide/67820cb9cd6df9ce2c4881ab)

### [Centroid Decomposition for Tree Algorithms: A Comprehensive Guide](https://blogs.arkainfotech.in/centroid-decomposition-for-tree-algorithms-a-comprehensive-guide?utm_source=hashnode&utm_medium=feed)

Guide on centroid decomposition: benefits, applications, and implementation for optimizing tree algorithms like LCA and dynamic programming

7 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/centroid-decomposition-for-tree-algorithms-a-comprehensive-guide?utm_source=hashnode&utm_medium=feed)

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/euler-tour-technique-for-tree-problems/67822178775a84088f600c53)

### [Euler Tour Technique for Tree Problems](https://blogs.arkainfotech.in/euler-tour-technique-for-tree-problems?utm_source=hashnode&utm_medium=feed)

Learn the Euler Tour Technique to efficiently solve tree problems like LCA queries and subtree queries with examples and code implementation

7 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/euler-tour-technique-for-tree-problems?utm_source=hashnode&utm_medium=feed)

[Arka Infotech](https://hashnode.com/@arkainfotech) · [Jan 11, 2025](https://hashnode.com/posts/heavy-light-decomposition-an-advanced-graph-algorithm/6782086a0b6d01f755fb3836)

### [Heavy Light Decomposition: An Advanced Graph Algorithm](https://blogs.arkainfotech.in/heavy-light-decomposition-an-advanced-graph-algorithm?utm_source=hashnode&utm_medium=feed)

Heavy Light Decomposition: optimizes tree queries/updates, ideal for competitive programming and efficient tree operations

7 min read · [blogs.arkainfotech.in](https://blogs.arkainfotech.in/heavy-light-decomposition-an-advanced-graph-algorithm?utm_source=hashnode&utm_medium=feed)
