<?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>Data Structures &#8211; Database Math </title>
	<atom:link href="https://databasemath.com/category/programming/data-structures/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 13:35:33 +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: Queue</title>
		<link>https://databasemath.com/2021/08/31/data-structures-queue/</link>
					<comments>https://databasemath.com/2021/08/31/data-structures-queue/#respond</comments>
		
		<dc:creator><![CDATA[Avery Lane]]></dc:creator>
		<pubDate>Tue, 31 Aug 2021 13:35:31 +0000</pubDate>
				<category><![CDATA[All Posts]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[dequeue]]></category>
		<category><![CDATA[enqueue]]></category>
		<category><![CDATA[queue]]></category>
		<category><![CDATA[queuing system]]></category>
		<guid isPermaLink="false">https://databasemath.com/?p=386</guid>

					<description><![CDATA[A Queue is a FIFO (First In First Out — the element placed at first can be accessed at first) structure which can be commonly found in many programming languages. This structure is named as &#8220;queue&#8221; because it resembles a real-world queue — people waiting in a queue (line). Just like in like real life, &#8230; <a href="https://databasemath.com/2021/08/31/data-structures-queue/" class="more-link">Continue reading<span class="screen-reader-text"> "Data Structures: Queue"</span></a>]]></description>
		
					<wfw:commentRss>https://databasemath.com/2021/08/31/data-structures-queue/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Data Structures: Stack</title>
		<link>https://databasemath.com/2021/08/31/data-structures-stack/</link>
					<comments>https://databasemath.com/2021/08/31/data-structures-stack/#respond</comments>
		
		<dc:creator><![CDATA[Avery Lane]]></dc:creator>
		<pubDate>Tue, 31 Aug 2021 13:22:48 +0000</pubDate>
				<category><![CDATA[All Posts]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[expression evaluation]]></category>
		<category><![CDATA[isEmpty]]></category>
		<category><![CDATA[isFull]]></category>
		<category><![CDATA[linear data structure]]></category>
		<category><![CDATA[Peek]]></category>
		<category><![CDATA[Pop]]></category>
		<category><![CDATA[Push]]></category>
		<category><![CDATA[recursion programming]]></category>
		<category><![CDATA[stack]]></category>
		<guid isPermaLink="false">https://databasemath.com/?p=380</guid>

					<description><![CDATA[A Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO (Last In First Out) or FILO (First In Last Out). Push: Insert an element on to the top of the stack. Pop: Delete the topmost element and return it. Furthermore, the following &#8230; <a href="https://databasemath.com/2021/08/31/data-structures-stack/" class="more-link">Continue reading<span class="screen-reader-text"> "Data Structures: Stack"</span></a>]]></description>
		
					<wfw:commentRss>https://databasemath.com/2021/08/31/data-structures-stack/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>Data Structures: Array</title>
		<link>https://databasemath.com/2021/08/31/data-structures-array/</link>
					<comments>https://databasemath.com/2021/08/31/data-structures-array/#respond</comments>
		
		<dc:creator><![CDATA[Avery Lane]]></dc:creator>
		<pubDate>Tue, 31 Aug 2021 13:05:07 +0000</pubDate>
				<category><![CDATA[All Posts]]></category>
		<category><![CDATA[Data Structures]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Array]]></category>
		<category><![CDATA[contiguous]]></category>
		<category><![CDATA[Data structure]]></category>
		<guid isPermaLink="false">https://databasemath.com/?p=377</guid>

					<description><![CDATA[An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together. This makes it easier to calculate the position of each element by simply adding an offset to a base value, i.e., the memory location of the first element of the array. &#8230; <a href="https://databasemath.com/2021/08/31/data-structures-array/" class="more-link">Continue reading<span class="screen-reader-text"> "Data Structures: Array"</span></a>]]></description>
		
					<wfw:commentRss>https://databasemath.com/2021/08/31/data-structures-array/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<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>
