<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Binary Search Tree on Yosgi</title><link>https://yosgi.github.io/en/tags/binary-search-tree/</link><description>Recent content in Binary Search Tree on Yosgi</description><generator>Hugo</generator><language>en</language><lastBuildDate>Thu, 08 Oct 2026 01:31:25 +0000</lastBuildDate><atom:link href="https://yosgi.github.io/en/tags/binary-search-tree/index.xml" rel="self" type="application/rss+xml"/><item><title>783-Binary Search Tree Node Minimum Distance</title><link>https://yosgi.github.io/en/post/783-binary-search-tree-node-minimum-distance/</link><pubDate>Thu, 18 Mar 2021 00:00:00 +1300</pubDate><guid>https://yosgi.github.io/en/post/783-binary-search-tree-node-minimum-distance/</guid><description>Finding the minimum distance between BST nodes using the ordered property of in-order traversal.</description></item><item><title>99-Restore Binary Search Tree</title><link>https://yosgi.github.io/en/post/99-restore-binary-search-tree/</link><pubDate>Sat, 13 Mar 2021 00:00:00 +1300</pubDate><guid>https://yosgi.github.io/en/post/99-restore-binary-search-tree/</guid><description>Restoring a BST with two swapped nodes by locating them during an in-order traversal.</description></item><item><title>98-Verify Binary Search Tree</title><link>https://yosgi.github.io/en/post/98-verify-binary-search-tree/</link><pubDate>Sat, 13 Mar 2021 00:00:00 +1300</pubDate><guid>https://yosgi.github.io/en/post/98-verify-binary-search-tree/</guid><description>Validating a binary search tree by exploiting the increasing order of its in-order traversal.</description></item><item><title>669-Pruning a Binary Search Tree</title><link>https://yosgi.github.io/en/post/669-pruning-a-binary-search-tree/</link><pubDate>Thu, 11 Mar 2021 00:00:00 +1300</pubDate><guid>https://yosgi.github.io/en/post/669-pruning-a-binary-search-tree/</guid><description>Trimming a BST to a value range by recursing into the correct branch using the BST bounds.</description></item><item><title>450-Delete a node in a binary search tree</title><link>https://yosgi.github.io/en/post/450-delete-a-node-in-a-binary-search-tree/</link><pubDate>Thu, 11 Mar 2021 00:00:00 +1300</pubDate><guid>https://yosgi.github.io/en/post/450-delete-a-node-in-a-binary-search-tree/</guid><description>Deleting a node from a binary search tree by locating it via the BST property, then handling the three deletion cases.</description></item><item><title>1008-Pre-order traversal to construct a binary search tree</title><link>https://yosgi.github.io/en/post/1008-pre-order-traversal-to-construct-a-binary-search-tree/</link><pubDate>Wed, 10 Mar 2021 00:00:00 +1300</pubDate><guid>https://yosgi.github.io/en/post/1008-pre-order-traversal-to-construct-a-binary-search-tree/</guid><description>Constructing a binary search tree from its pre-order sequence by recursively inserting each value.</description></item></channel></rss>