<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>linked list &#8211; Database Math </title>
	<atom:link href="https://databasemath.com/tag/linked-list/feed/" rel="self" type="application/rss+xml" />
	<link>https://databasemath.com</link>
	<description>Database mathematics and more pragmatic information.</description>
	<lastBuildDate>Tue, 31 Aug 2021 12:49:10 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.0.1</generator>
	<item>
		<title>Data Structures: Doubly Linked List</title>
		<link>https://databasemath.com/2021/08/31/data-structures-doubly-linked-list/</link>
					<comments>https://databasemath.com/2021/08/31/data-structures-doubly-linked-list/#respond</comments>
		
		<dc:creator><![CDATA[Avery Lane]]></dc:creator>
		<pubDate>Tue, 31 Aug 2021 12:48:41 +0000</pubDate>
				<category><![CDATA[All Posts]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Doubly Linked List]]></category>
		<category><![CDATA[linked list]]></category>
		<category><![CDATA[next pointer]]></category>
		<category><![CDATA[previous pointer]]></category>
		<guid isPermaLink="false">https://databasemath.com/?p=373</guid>

					<description><![CDATA[A&#160;Doubly&#160;Linked&#160;List (DLL) is very similar to a Linked List, but contains an extra pointer, typically referred to as&#160;previous pointer, together with next pointer and the data. Advantages over singly linked list A doubly linked list can be traversed in both forward and backward direction.&#160; The delete operation for doubly linked lists is more efficient if &#8230; <a href="https://databasemath.com/2021/08/31/data-structures-doubly-linked-list/" class="more-link">Continue reading<span class="screen-reader-text"> "Data Structures: Doubly Linked List"</span></a>]]></description>
		
					<wfw:commentRss>https://databasemath.com/2021/08/31/data-structures-doubly-linked-list/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Data Structures: Linked List</title>
		<link>https://databasemath.com/2021/08/31/data-structures-linked-list/</link>
					<comments>https://databasemath.com/2021/08/31/data-structures-linked-list/#respond</comments>
		
		<dc:creator><![CDATA[Avery Lane]]></dc:creator>
		<pubDate>Tue, 31 Aug 2021 12:35:02 +0000</pubDate>
				<category><![CDATA[All Posts]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[linear data structure]]></category>
		<category><![CDATA[linked list]]></category>
		<category><![CDATA[pointer]]></category>
		<guid isPermaLink="false">https://databasemath.com/?p=370</guid>

					<description><![CDATA[Like arrays, the Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at a contiguous location; the elements are linked using pointers.]]></description>
		
					<wfw:commentRss>https://databasemath.com/2021/08/31/data-structures-linked-list/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
