<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Trees on AI VOID</title><link>https://ai-blog.noorshomelab.dev/tags/trees/</link><description>Recent content in Trees on AI VOID</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 16 Feb 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://ai-blog.noorshomelab.dev/tags/trees/index.xml" rel="self" type="application/rss+xml"/><item><title>Chapter 11: Trees: Hierarchical Data</title><link>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/trees-hierarchical-data/</link><pubDate>Mon, 16 Feb 2026 00:00:00 +0000</pubDate><guid>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/trees-hierarchical-data/</guid><description>&lt;h2 id="introduction"&gt;Introduction&lt;/h2&gt;
&lt;p&gt;Welcome back, aspiring data structure wizard! So far, we&amp;rsquo;ve mostly explored linear data structures like arrays, linked lists, stacks, and queues. These structures are fantastic for organizing data in a sequential fashion. But what if your data isn&amp;rsquo;t sequential? What if it has inherent relationships, like a family tree, an organizational chart, or the folders on your computer?&lt;/p&gt;
&lt;p&gt;This is where &lt;strong&gt;Trees&lt;/strong&gt; come into play! In this chapter, we&amp;rsquo;re going to dive into the exciting world of non-linear, hierarchical data structures. You&amp;rsquo;ll learn what a tree is, its fundamental terminology, why it&amp;rsquo;s so powerful for representing complex relationships, and we&amp;rsquo;ll even build a basic generic tree implementation using TypeScript. Get ready to branch out your understanding of data organization!&lt;/p&gt;</description></item></channel></rss>