<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Binary-Trees on Algorithms in 60 Days</title><link>https://algorithmsin60days.com/tags/binary-trees/</link><description>Recent content in Binary-Trees on Algorithms in 60 Days</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 10 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://algorithmsin60days.com/tags/binary-trees/index.xml" rel="self" type="application/rss+xml"/><item><title>Trees: A Study Guide</title><link>https://algorithmsin60days.com/topics/trees/</link><pubDate>Fri, 10 Jul 2026 00:00:00 +0000</pubDate><guid>https://algorithmsin60days.com/topics/trees/</guid><description>&lt;p&gt;A tree is a hierarchical structure of nodes with one root and no cycles: every node except the root has exactly one parent. A &lt;strong&gt;binary tree&lt;/strong&gt; limits each node to at most two children (left and right). A &lt;strong&gt;binary search tree (BST)&lt;/strong&gt; adds an ordering invariant: everything in the left subtree is smaller than the node, everything in the right subtree is larger. That invariant is what makes a balanced BST fast to search.&lt;/p&gt;</description></item></channel></rss>