<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Binary Search Tree on Evan Hoffman</title><link>https://evan.wtf/tags/binary-search-tree/</link><description>Recent content in Binary Search Tree on Evan Hoffman</description><generator>Hugo</generator><language>en-US</language><copyright>Evan Hoffman</copyright><lastBuildDate>Sun, 09 May 2010 13:43:17 +0000</lastBuildDate><atom:link href="https://evan.wtf/tags/binary-search-tree/index.xml" rel="self" type="application/rss+xml"/><item><title>Java Code: searching a Binary Search Tree for the largest value strictly less than X</title><link>https://evan.wtf/2010/05/09/java-code-searching-a-binary-search-tree-for-the-largest-value-strictly-less-than-x/</link><pubDate>Sun, 09 May 2010 13:43:17 +0000</pubDate><guid>https://evan.wtf/2010/05/09/java-code-searching-a-binary-search-tree-for-the-largest-value-strictly-less-than-x/</guid><description>Java code for creating and searching a Binary Search Tree of any element implementing the Comparable interface.</description></item></channel></rss>