AArka Infotech·Jan 11, 2025Morris Traversal: In-Order Traversal Without RecursionLearn about Morris Traversal: efficient in-order binary tree traversal without recursion or a stack, achieving O(n) time and O(1) space complexity6 min read·blogs.arkainfotech.in
AArka Infotech·Jan 11, 2025Centroid Decomposition for Tree Algorithms: A Comprehensive GuideGuide on centroid decomposition: benefits, applications, and implementation for optimizing tree algorithms like LCA and dynamic programming7 min read·blogs.arkainfotech.in
AArka Infotech·Jan 11, 2025Euler Tour Technique for Tree ProblemsLearn the Euler Tour Technique to efficiently solve tree problems like LCA queries and subtree queries with examples and code implementation7 min read·blogs.arkainfotech.in
AArka Infotech·Jan 11, 2025Heavy Light Decomposition: An Advanced Graph AlgorithmHeavy Light Decomposition: optimizes tree queries/updates, ideal for competitive programming and efficient tree operations7 min read·blogs.arkainfotech.in