<?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>algorithm for creation of singly linked list in data structure - Wikitechy</title>
	<atom:link href="https://www.wikitechy.com/interview-questions/tag/algorithm-for-creation-of-singly-linked-list-in-data-structure/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.wikitechy.com/interview-questions/tag/algorithm-for-creation-of-singly-linked-list-in-data-structure/</link>
	<description>Interview Questions</description>
	<lastBuildDate>Mon, 13 Sep 2021 07:11:37 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.9.4</generator>

<image>
	<url>https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png</url>
	<title>algorithm for creation of singly linked list in data structure - Wikitechy</title>
	<link>https://www.wikitechy.com/interview-questions/tag/algorithm-for-creation-of-singly-linked-list-in-data-structure/</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>What is Linked List in Data Structure with example ?</title>
		<link>https://www.wikitechy.com/interview-questions/data-structure/what-is-linked-list-in-data-structure-with-example/</link>
					<comments>https://www.wikitechy.com/interview-questions/data-structure/what-is-linked-list-in-data-structure-with-example/#respond</comments>
		
		<dc:creator><![CDATA[Editor]]></dc:creator>
		<pubDate>Tue, 13 Jul 2021 15:28:48 +0000</pubDate>
				<category><![CDATA[Data Structure]]></category>
		<category><![CDATA[Accenture interview questions and answers]]></category>
		<category><![CDATA[algorithm for creation of singly linked list in data structure]]></category>
		<category><![CDATA[Altimetrik India Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[Apostek Software Interview Questions and Answers]]></category>
		<category><![CDATA[application of linked list in data structure]]></category>
		<category><![CDATA[Applied Materials interview questions and answers]]></category>
		<category><![CDATA[Bharti Airtel interview questions and answers]]></category>
		<category><![CDATA[BMC Software interview questions and answers]]></category>
		<category><![CDATA[Capgemini interview questions and answers]]></category>
		<category><![CDATA[CASTING NETWORKS INDIA PVT LIMITED interview questions and answers]]></category>
		<category><![CDATA[CGI Group Inc interview questions and answers]]></category>
		<category><![CDATA[Chetu interview questions and answers]]></category>
		<category><![CDATA[Ciena Corporation interview questions and answers]]></category>
		<category><![CDATA[circular linked list in data structure]]></category>
		<category><![CDATA[circular linked list in data structure program]]></category>
		<category><![CDATA[Collabera Te interview questions and answers]]></category>
		<category><![CDATA[data structure projects using linked list]]></category>
		<category><![CDATA[deletion in linked list in data structure]]></category>
		<category><![CDATA[Dell International Services India Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[doubly linked list]]></category>
		<category><![CDATA[doubly linked list deletion]]></category>
		<category><![CDATA[doubly linked list in c]]></category>
		<category><![CDATA[doubly linked list in c++ source code]]></category>
		<category><![CDATA[doubly linked list in data structure]]></category>
		<category><![CDATA[doubly linked list insertion]]></category>
		<category><![CDATA[doubly linked list java]]></category>
		<category><![CDATA[doubly linked list program in data structure]]></category>
		<category><![CDATA[example of linked list in data structure]]></category>
		<category><![CDATA[Flipkart interview questions and answers]]></category>
		<category><![CDATA[Genpact interview questions and answers]]></category>
		<category><![CDATA[Globallogic India Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[IBM interview questions and answers]]></category>
		<category><![CDATA[Indecomm Global Services interview questions and answers]]></category>
		<category><![CDATA[insertion and deletion in linked list in data structure]]></category>
		<category><![CDATA[java linked list traversal]]></category>
		<category><![CDATA[linked list algorithm in data structure]]></category>
		<category><![CDATA[linked list c]]></category>
		<category><![CDATA[linked list data structure in c]]></category>
		<category><![CDATA[linked list data structure in java]]></category>
		<category><![CDATA[linked list in data structure]]></category>
		<category><![CDATA[linked list in data structure using c]]></category>
		<category><![CDATA[linked list insertion]]></category>
		<category><![CDATA[linked list program in data structure]]></category>
		<category><![CDATA[linked lists java]]></category>
		<category><![CDATA[Mphasis interview questions and answers]]></category>
		<category><![CDATA[NetApp interview questions and answers]]></category>
		<category><![CDATA[Oracle Corporation interview questions and answers]]></category>
		<category><![CDATA[SAP Labs India Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[Sapient Consulting Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[singly linked list algorithm]]></category>
		<category><![CDATA[singly linked list algorithm in data structure]]></category>
		<category><![CDATA[singly linked list c++]]></category>
		<category><![CDATA[singly linked list in data structure]]></category>
		<category><![CDATA[singly linked list in data structure program]]></category>
		<category><![CDATA[singly linked list java]]></category>
		<category><![CDATA[singly linked list program in c]]></category>
		<category><![CDATA[singly linked list program in data structure]]></category>
		<category><![CDATA[Tech Mahindra interview questions and answers]]></category>
		<category><![CDATA[Tracxn Technologies Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[types of linked list]]></category>
		<category><![CDATA[types of linked list in data structure]]></category>
		<category><![CDATA[UnitedHealth Group interview questions and answers]]></category>
		<category><![CDATA[what is linked list in data structure]]></category>
		<category><![CDATA[Wipro Infotech interview questions and answers]]></category>
		<category><![CDATA[WM Global Technology Services India Pvt.Ltd Limited (WMGTS) interview questions and answers]]></category>
		<category><![CDATA[Xoriant Solutions Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[Yodlee Infotech Pvt Ltd interview questions and answers]]></category>
		<guid isPermaLink="false">https://www.wikitechy.com/interview-questions/?p=493</guid>

					<description><![CDATA[Answer : A linked list is a sequence of data structures, which are connected...]]></description>
										<content:encoded><![CDATA[<div class="TextHeading">
<div class="hddn">
<h2 id="what-is-linked-list-in-data-structure-with-example" class="color-pink" style="text-align: justify;">What is Linked List in Data Structure with example ?</h2>
</div>
</div>
<div class="Content">
<div class="hddn">
<ul style="text-align: justify;">
<li>A linked list is a sequence of <a href="https://www.wikitechy.com/interview-questions/data-structure/what-is-data-structure/" target="_blank" rel="noopener">data structures</a>, which are connected together through links.</li>
<li><a href="https://www.wikitechy.com/tutorials/java/java-linked-list" target="_blank" rel="noopener">Linked List</a> is a sequence of links which contains objects. Each link contains a connection to another link. Linked list is the second most-used data structure after array.
<ul>
<li><b>Link − </b>Each link of a linked list can store a data called an element.</li>
<li><b>Next − </b>Each link of a linked list contains a link to the next link called Next.</li>
<li><b>LinkedList −</b> A Linked List contains the connection link to the first link called First.</li>
</ul>
</li>
</ul>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>A linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.</li>
</ul>
</div>
</div>
<div class="ImageContent">
<div class="hddn"><img decoding="async" class="img-responsive center-block aligncenter" src="https://cdn.wikitechy.com/interview-questions/data-structure/linked-list-in-data-structure.png" alt="Linked List in Data Structure" /></div>
<div>
<div class="TextHeading" style="text-align: justify;">
<div class="hddn">
<h2 id="types-of-linked-lists" class="color-purple">Types of Linked Lists</h2>
</div>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>Singly linked list</li>
<li>Doubly linked list</li>
<li>Circular linked list</li>
</ul>
</div>
</div>
<div class="subheading" style="text-align: justify;">
<h2 id="singly-linked-list">Singly linked list</h2>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>A <a href="https://www.wikitechy.com/technology/python-programming-select-random-node-singly-linked-list/">singly linked list</a> is Item navigation is forward only.</li>
</ul>
</div>
</div>
<div class="ImageContent" style="text-align: justify;">
<div class="hddn"><img decoding="async" class="img-responsive center-block aligncenter" src="https://cdn.wikitechy.com/interview-questions/data-structure/singly-linked-list.png" alt="Singly Linked List" /></div>
</div>
<div class="subheading" style="text-align: justify;">
<h2 id="doubly-linked-list">Doubly linked list</h2>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>A doubly linked list is a list that has two references, one to the next node and another to previous node.</li>
</ul>
</div>
</div>
<div class="ImageContent">
<div class="hddn"><img decoding="async" class="img-responsive center-block aligncenter" src="https://cdn.wikitechy.com/interview-questions/data-structure/doubly-linked-list.gif" alt="Doubly linked list" /></div>
<div>
<div class="subheading" style="text-align: justify;">
<h2 id="circular-linked-list">Circular linked list</h2>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>Another important type of a linked list is called a <a href="https://www.wikitechy.com/technology/circular-linked-list-introduction-applications/" target="_blank" rel="noopener">circular linked list</a> where last node of the list points back to the first node (or the head) of the list.</li>
</ul>
</div>
</div>
<div class="ImageContent" style="text-align: justify;">
<div class="hddn"><img decoding="async" class="img-responsive center-block aligncenter" src="https://cdn.wikitechy.com/interview-questions/data-structure/circular-linked-list.jpg" alt="Circular linked list" /></div>
</div>
<div class="subheading" style="text-align: justify;">
<h2 id="doubly-circular-linked-list">Doubly Circular linked list</h2>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>Circular doubly linked list is a type of data structure in which a node contain pointers to its previous node as well as the next node.</li>
<li>Circular doubly linked list doesn&#8217;t contain NULL in any of the node.</li>
<li>The last node contains the address of the first node of the list. The first node also contain address of the last node in its previous pointer.</li>
</ul>
</div>
</div>
<div class="ImageContent">
<div class="hddn"><img decoding="async" class="img-responsive center-block aligncenter" src="https://cdn.wikitechy.com/interview-questions/data-structure/doubly-circular-linked-list.jpg" alt="Doubly Circular linked list" /></div>
<div>
<h2 id="sample-code" class="color-purple" style="text-align: justify;">Sample Code:</h2>
<div class="code-embed-wrapper"> <div class="code-embed-infos"> </div> <pre class="language-javascript code-embed-pre line-numbers"  data-start="1" data-line-offset="0"><code class="language-javascript code-embed-code">#include&lt;stdio.h&gt;<br/>#include &lt;stdlib.h&gt;<br/>int main()<br/>{<br/>   struct node<br/>   {<br/>      int num;<br/>      struct node *ptr;<br/>   };<br/>   typedef struct node NODE;<br/>   NODE *head, *first, *temp=0;<br/>   int count = 0;<br/>   int choice = 1;<br/>   first = 0;<br/>   while(choice)<br/>   {<br/>      head =(NODE*) malloc(sizeof(NODE));<br/>      printf(&quot;Enter the data item: &quot;);<br/>      scanf(&quot;%d&quot;, &amp;head-&gt; num);<br/>      if(first != 0)<br/>      {<br/>         temp-&gt;ptr = head;temp = head;<br/>      }<br/>      else<br/>      {<br/>         first = temp = head;<br/>      }<br/>      fflush(stdin);<br/>      printf(&quot;Do you want to continue(Type 0 or 1)?\n\n&quot;);<br/>      scanf(&quot;%d&quot;, &amp;choice);<br/>   }<br/>   temp-&gt;ptr = 0;<br/>   temp = first; /* reset temp to the beginning*/<br/>   printf(&quot;\n Status of the linked list is\n&quot;);<br/>   while(temp!=0)<br/>   {<br/>      printf(&quot;%d=&gt;&quot;, temp-&gt;num);<br/>      count++;<br/>      temp = temp -&gt; ptr;<br/>   }<br/>   printf(&quot;NULL\n&quot;);<br/>   printf(&quot;No. of nodes in the list = %d\n&quot;, count);<br/>   return 0;<br/>}</code></pre> </div>
<h2 id="output" class="color-purple" style="text-align: justify;">Output:</h2>
<div class="code-embed-wrapper"> <div class="code-embed-infos"> </div> <pre class="language-markdown code-embed-pre line-numbers"  data-start="1" data-line-offset="0"><code class="language-markdown code-embed-code">Enter the data item: 10<br/>Do you want to continue &lt;Type 0 or 1&gt;?<br/>1<br/>Enter the data item: 20<br/>Do you want to continue&lt;Type 0 or 1&gt;?<br/>1<br/>Enter the data item: 30<br/>Do you want to continue&lt;Type 0 or 1&gt;?<br/>0<br/>Status of the Linked List is<br/>10=&gt;20=&gt;30=&gt;NULL<br/>No.of nodes in the list = 3</code></pre> </div>
<div class="TextHeading" style="text-align: justify;">
<div class="hddn">
<h2 id="advantages-of-linked-list" class="color-purple">Advantages of Linked List</h2>
</div>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>Linked list is dynamic in nature which allocates the memory when required.</li>
<li>In linked list, stack and queue can be easily executed.</li>
<li>It reduces the access time.</li>
<li>Insert and delete operation can be easily implemented in linked list.</li>
</ul>
</div>
</div>
<div class="TextHeading" style="text-align: justify;">
<div class="hddn">
<h2 id="disadvantages-of-linked-list" class="color-purple">Disadvantages of Linked List</h2>
</div>
</div>
<div class="Content">
<div class="hddn">
<ul>
<li style="text-align: justify;">Reverse traversing is difficult in linked list.</li>
<li style="text-align: justify;">Linked list has to access each node sequentially; no element can be accessed randomly.</li>
<li style="text-align: justify;">In linked list, the memory is wasted as pointer requires extra memory for storage.</li>
</ul>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
]]></content:encoded>
					
					<wfw:commentRss>https://www.wikitechy.com/interview-questions/data-structure/what-is-linked-list-in-data-structure-with-example/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
