<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Tree on AI VOID</title><link>https://ai-blog.noorshomelab.dev/tags/tree/</link><description>Recent content in Tree 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/tree/index.xml" rel="self" type="application/rss+xml"/><item><title>Chapter 12: Binary Search Trees: Ordered Trees</title><link>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/binary-search-trees-ordered/</link><pubDate>Mon, 16 Feb 2026 00:00:00 +0000</pubDate><guid>https://ai-blog.noorshomelab.dev/dsa-typescript-mastery-2026/binary-search-trees-ordered/</guid><description>&lt;h2 id="introduction-to-binary-search-trees"&gt;Introduction to Binary Search Trees&lt;/h2&gt;
&lt;p&gt;Welcome back, intrepid coder! In the previous chapters, we explored various ways to organize data, from simple arrays and linked lists to the hierarchical power of general trees. We saw how trees give us a flexible way to represent relationships, like file systems or organizational charts.&lt;/p&gt;
&lt;p&gt;Now, we&amp;rsquo;re going to introduce a special kind of tree that combines the hierarchical structure of a tree with a powerful ordering principle: the &lt;strong&gt;Binary Search Tree (BST)&lt;/strong&gt;. Imagine a data structure that not only stores information but also keeps it sorted in a way that makes finding, adding, and removing items incredibly efficient. That&amp;rsquo;s the magic of a BST!&lt;/p&gt;</description></item></channel></rss>