<?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>Pop &#8211; Database Math </title>
	<atom:link href="https://databasemath.com/tag/pop/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:23:42 +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: 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>
	</channel>
</rss>
