<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Sun, 26 Apr 2026 10:12:20 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/binarysearchtree/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Advantage of BST (BInary Search Tree) over Hash Table]]></title><description><![CDATA[What is binary Search tree? BST is the node-based binary tree data structure. A binary tree is a tree that has almost 2 children. The Binary search tree differs from the Binary tree in the aspect that:-]]></description><link>http://direct.ecency.com/hive-169321/@aco5/advantage-of-bst-binary-search-tree-over-hash-table</link><guid isPermaLink="true">http://direct.ecency.com/hive-169321/@aco5/advantage-of-bst-binary-search-tree-over-hash-table</guid><category><![CDATA[hive-169321]]></category><dc:creator><![CDATA[aco5]]></dc:creator><pubDate>Mon, 10 May 2021 15:20:15 GMT</pubDate></item><item><title><![CDATA[Binary Search Trees]]></title><description><![CDATA[By No machine-readable author provided. Dcoetzee assumed (based on copyright claims). [Public domain], via Wikimedia Commons Trees are a common data structure in programming. Binary Search Trees are sorted]]></description><link>http://direct.ecency.com/programming/@dana-edwards/binary-search-trees</link><guid isPermaLink="true">http://direct.ecency.com/programming/@dana-edwards/binary-search-trees</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[dana-edwards]]></dc:creator><pubDate>Sat, 28 Oct 2017 12:46:36 GMT</pubDate><enclosure url="https://images.ecency.com/p/2VZXybTSZJq1X7aJh6Tea9hH32UiACTTr52L2neq6Jp8nv9ZBMfSweMYjidK37SGVArgbD4USHCNRQXGujNjTd9ACepoB8noemUuzTf5CbAdtzUHnFXFWXmSBXU4JDBiDRYGzihQsxqmbLesASHmozUbCb8?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>