<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.3.1" -->
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	>
<channel>
	<title>Comments on: Reverse linked list using pointers</title>
	<link>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/</link>
	<description>C/C++ Programming Blog</description>
	<pubDate>Fri, 25 Jul 2008 12:43:59 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: Jonah Dempcy</title>
		<link>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-26485</link>
		<dc:creator>Jonah Dempcy</dc:creator>
		<pubDate>Wed, 14 May 2008 10:39:40 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-26485</guid>
		<description>I wrote an implementation of the LinkedList class in JavaScript using the MooTools library. I also wrote a challenge and solution to reversing a singly linked list:

http://www.thetruetribe.com/2008/05/javascript-challenge-reverse-linked.html</description>
		<content:encoded><![CDATA[<p>I wrote an implementation of the LinkedList class in JavaScript using the MooTools library. I also wrote a challenge and solution to reversing a singly linked list:</p>
<p><a href="http://www.thetruetribe.com/2008/05/javascript-challenge-reverse-linked.html" rel="nofollow">http://www.thetruetribe.com/2008/05/javascript-challenge-reverse-linked.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Vasant Kumar</title>
		<link>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-14868</link>
		<dc:creator>Vasant Kumar</dc:creator>
		<pubDate>Wed, 19 Dec 2007 15:20:41 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-14868</guid>
		<description>This site so far concentrated on linked lists in data structures, is there any chance of writing about other data structures in the same depth...</description>
		<content:encoded><![CDATA[<p>This site so far concentrated on linked lists in data structures, is there any chance of writing about other data structures in the same depth&#8230;</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mike</title>
		<link>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-1030</link>
		<dc:creator>Mike</dc:creator>
		<pubDate>Fri, 18 May 2007 07:18:15 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-1030</guid>
		<description>wow! pretty illustrative, I can only say keep the good work bro.</description>
		<content:encoded><![CDATA[<p>wow! pretty illustrative, I can only say keep the good work bro.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Reversing a single linked list using stack</title>
		<link>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-907</link>
		<dc:creator>Reversing a single linked list using stack</dc:creator>
		<pubDate>Fri, 30 Mar 2007 10:10:27 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-907</guid>
		<description>[...] Here is the routine for reversing single linked list using a stack, for reversing linked list using pointers, see the earlier post. For reversing linked list recursively visit this post. This routine takes a single linked list as argument and reverse it and returns back the head node to the reversed list. [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] Here is the routine for reversing single linked list using a stack, for reversing linked list using pointers, see the earlier post. For reversing linked list recursively visit this post. This routine takes a single linked list as argument and reverse it and returns back the head node to the reversed list. [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Reversing single linked list recursively</title>
		<link>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-901</link>
		<dc:creator>Reversing single linked list recursively</dc:creator>
		<pubDate>Fri, 30 Mar 2007 10:00:59 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-901</guid>
		<description>[...] Here is the routine for reversing single linked list recursively, for reversing iteratively see the  earlier post . For reversing circular single linked list visit this post. This routine takes a single linked list as argument and reverse it and returns back the head node to the reversed list. [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] Here is the routine for reversing single linked list recursively, for reversing iteratively see the  earlier post . For reversing circular single linked list visit this post. This routine takes a single linked list as argument and reverse it and returns back the head node to the reversed list. [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Reversing a circular single linked list using pointers</title>
		<link>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-68</link>
		<dc:creator>Reversing a circular single linked list using pointers</dc:creator>
		<pubDate>Sat, 10 Mar 2007 11:20:41 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reverse-linked-list-using-3-ptrs/#comment-68</guid>
		<description>[...] Reversing a single linked list is explained in this post [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] Reversing a single linked list is explained in this post [&#8230;]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
