<?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: Reversing a double linked list</title>
	<link>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/</link>
	<description>C/C++ Programming Blog</description>
	<pubDate>Sun, 06 Jul 2008 20:24:03 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.3.1</generator>
		<item>
		<title>By: Jonah Dempcy</title>
		<link>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-26487</link>
		<dc:creator>Jonah Dempcy</dc:creator>
		<pubDate>Wed, 14 May 2008 10:45:40 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-26487</guid>
		<description>Nice article! I wrote an article on creating a LinkedList class in JavaScript using the MooTools framework. I only wrote a singly-linked list but I may extend it to support doubly-linked lists and in that case, I will certainly put forth the challenge to reverse a doubly-linked list.

Here is the challenge I put forth to reverse a singly-linked list in JS:

http://www.thetruetribe.com/2008/05/javascript-challenge-reverse-linked.html</description>
		<content:encoded><![CDATA[<p>Nice article! I wrote an article on creating a LinkedList class in JavaScript using the MooTools framework. I only wrote a singly-linked list but I may extend it to support doubly-linked lists and in that case, I will certainly put forth the challenge to reverse a doubly-linked list.</p>
<p>Here is the challenge I put forth to reverse a singly-linked list in JS:</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: Kanza</title>
		<link>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-24507</link>
		<dc:creator>Kanza</dc:creator>
		<pubDate>Thu, 01 May 2008 06:51:47 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-24507</guid>
		<description>Hello!
    Well the information given in your website is proved to be very useful for me. I could not find this information in any other website. Specially the reversing  of linked lists.
                                        Thank You ,
                                         Kanza</description>
		<content:encoded><![CDATA[<p>Hello!<br />
    Well the information given in your website is proved to be very useful for me. I could not find this information in any other website. Specially the reversing  of linked lists.<br />
                                        Thank You ,<br />
                                         Kanza</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jazzyg</title>
		<link>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-17463</link>
		<dc:creator>jazzyg</dc:creator>
		<pubDate>Mon, 31 Mar 2008 09:47:58 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-17463</guid>
		<description>In case of dounly link list, its pretty eay to reverse it. Simply reverse prev and Next pointer in a node. Fot head, set prev = Null and for Tail, Next = Null</description>
		<content:encoded><![CDATA[<p>In case of dounly link list, its pretty eay to reverse it. Simply reverse prev and Next pointer in a node. Fot head, set prev = Null and for Tail, Next = Null</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Lucas</title>
		<link>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-15829</link>
		<dc:creator>Lucas</dc:creator>
		<pubDate>Wed, 16 Jan 2008 12:01:37 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-15829</guid>
		<description>good work</description>
		<content:encoded><![CDATA[<p>good work</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Mike</title>
		<link>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-1028</link>
		<dc:creator>Mike</dc:creator>
		<pubDate>Fri, 18 May 2007 07:12:15 +0000</pubDate>
		<guid>http://www.openasthra.com/c-tidbits/reversing-a-double-linked-list/#comment-1028</guid>
		<description>overall, very good articles, keep the good work..</description>
		<content:encoded><![CDATA[<p>overall, very good articles, keep the good work..</p>
]]></content:encoded>
	</item>
</channel>
</rss>
