<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	
	>
<channel>
	<title>Comments on: Computer Algorithms: Binary Search Tree</title>
	<atom:link href="/2012/06/22/computer-algorithms-binary-search-tree-data-structure/feed/" rel="self" type="application/rss+xml" />
	<link>/2012/06/22/computer-algorithms-binary-search-tree-data-structure/</link>
	<description>on web development</description>
	<lastBuildDate>Fri, 26 Oct 2018 21:40:18 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>https://wordpress.org/?v=5.0.3</generator>
	<item>
		<title>By: Frank</title>
		<link>/2012/06/22/computer-algorithms-binary-search-tree-data-structure/comment-page-1/#comment-19517</link>
		<dc:creator><![CDATA[Frank]]></dc:creator>
		<pubDate>Mon, 14 Oct 2013 20:06:12 +0000</pubDate>
		<guid isPermaLink="false">/?p=3196#comment-19517</guid>
		<description><![CDATA[Nice post. I&#039;ve read many articles on binary trees and this helped me the most. I guess it&#039;s because I never took any data structures classes and so didn&#039;t understand many of the basic definitions that others just take for granted. Thanks very much.

I do have two questions. In the fourth graphic down, labelled simply &quot;Trees&quot;, in picture #4, are those right sub-trees? They are labelled &quot;left.&quot;
There is a distinction made between a &quot;binary trees&quot; and &quot;binary search trees&quot;. They seem to me to the same as &quot;unbalanced binary trees&quot; and &quot;balanced binary trees&quot; although the balanced trees may be sub-optimally balanced. Is that a correct understanding? Thanks.]]></description>
		<content:encoded><![CDATA[<p>Nice post. I&#8217;ve read many articles on binary trees and this helped me the most. I guess it&#8217;s because I never took any data structures classes and so didn&#8217;t understand many of the basic definitions that others just take for granted. Thanks very much.</p>
<p>I do have two questions. In the fourth graphic down, labelled simply &#8220;Trees&#8221;, in picture #4, are those right sub-trees? They are labelled &#8220;left.&#8221;<br />
There is a distinction made between a &#8220;binary trees&#8221; and &#8220;binary search trees&#8221;. They seem to me to the same as &#8220;unbalanced binary trees&#8221; and &#8220;balanced binary trees&#8221; although the balanced trees may be sub-optimally balanced. Is that a correct understanding? Thanks.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: AfterMath</title>
		<link>/2012/06/22/computer-algorithms-binary-search-tree-data-structure/comment-page-1/#comment-16351</link>
		<dc:creator><![CDATA[AfterMath]]></dc:creator>
		<pubDate>Wed, 18 Jul 2012 15:27:47 +0000</pubDate>
		<guid isPermaLink="false">/?p=3196#comment-16351</guid>
		<description><![CDATA[Nice stuff. 

I implemented this on my web site to help with explanations. Check it out. 

http://www.learninglover.com/examples.php?id=24]]></description>
		<content:encoded><![CDATA[<p>Nice stuff. </p>
<p>I implemented this on my web site to help with explanations. Check it out. </p>
<p><a href="http://www.learninglover.com/examples.php?id=24" rel="nofollow">http://www.learninglover.com/examples.php?id=24</a></p>
]]></content:encoded>
	</item>
</channel>
</rss>
