<?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 insertion - Wikitechy</title>
	<atom:link href="https://www.wikitechy.com/interview-questions/tag/linked-list-insertion/feed/" rel="self" type="application/rss+xml" />
	<link>https://www.wikitechy.com/interview-questions/tag/linked-list-insertion/</link>
	<description>Interview Questions</description>
	<lastBuildDate>Mon, 13 Sep 2021 10:24:56 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.0</generator>

<image>
	<url>https://www.wikitechy.com/interview-questions/wp-content/uploads/2025/10/cropped-wikitechy-icon-32x32.png</url>
	<title>linked list insertion - Wikitechy</title>
	<link>https://www.wikitechy.com/interview-questions/tag/linked-list-insertion/</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>How to make linked list program for the given list ?</title>
		<link>https://www.wikitechy.com/interview-questions/data-structure/how-to-make-linked-list-program-for-the-given-list/</link>
					<comments>https://www.wikitechy.com/interview-questions/data-structure/how-to-make-linked-list-program-for-the-given-list/#respond</comments>
		
		<dc:creator><![CDATA[Editor]]></dc:creator>
		<pubDate>Tue, 13 Jul 2021 17:24:03 +0000</pubDate>
				<category><![CDATA[Data Structure]]></category>
		<category><![CDATA[Accenture interview questions and answers]]></category>
		<category><![CDATA[Altimetrik India Pvt Ltd interview questions and answers]]></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[Collabera Te interview questions and answers]]></category>
		<category><![CDATA[Dell International Services India Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[doubly linked list implementation in java]]></category>
		<category><![CDATA[ecare technology labs interview questions and answers]]></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[how to create a linked list in java]]></category>
		<category><![CDATA[how to create a node in linked list in java]]></category>
		<category><![CDATA[IBM interview questions and answers]]></category>
		<category><![CDATA[Indecomm Global Services interview questions and answers]]></category>
		<category><![CDATA[insert a node at a specific position in a linked list in java]]></category>
		<category><![CDATA[insert node at beginning of linked list in java]]></category>
		<category><![CDATA[insert node at beginning of linked list java program]]></category>
		<category><![CDATA[insertion in linked list algorithm]]></category>
		<category><![CDATA[java program to insert a node at the end in linked list]]></category>
		<category><![CDATA[linked list add method implementation]]></category>
		<category><![CDATA[linked list data structure in java]]></category>
		<category><![CDATA[linked list implementation in java]]></category>
		<category><![CDATA[linked list in java]]></category>
		<category><![CDATA[linked list in java program]]></category>
		<category><![CDATA[linked list insertion]]></category>
		<category><![CDATA[linked list java]]></category>
		<category><![CDATA[linked list java code]]></category>
		<category><![CDATA[linked list java program]]></category>
		<category><![CDATA[linked list node java]]></category>
		<category><![CDATA[linked list program in java]]></category>
		<category><![CDATA[linked list program in java for insertion and deletion]]></category>
		<category><![CDATA[linked list program in java with explanation]]></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 in data structure]]></category>
		<category><![CDATA[singly linked list java]]></category>
		<category><![CDATA[singly linked list program in java]]></category>
		<category><![CDATA[Tech Mahindra interview questions and answers]]></category>
		<category><![CDATA[Tracxn Technologies Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[UnitedHealth Group interview questions and answers]]></category>
		<category><![CDATA[user defined linked list in java]]></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=505</guid>

					<description><![CDATA[Answer : Linked List is a type of Linear Data Structure that is mostly used data structure....
]]></description>
										<content:encoded><![CDATA[<div class="TextHeading">
<div class="hddn">
<h2 id="how-to-make-linked-list-program-for-the-given-list" class="color-pink" style="text-align: justify;">How to make linked list program for the given list ?</h2>
</div>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li><a href="https://www.wikitechy.com/interview-questions/data-structure/what-is-linked-list-in-data-structure-with-example/" target="_blank" rel="noopener">Linked List</a> is a type of Linear <a href="https://www.wikitechy.com/interview-questions/data-structure/what-is-data-structure/" target="_blank" rel="noopener">Data Structure</a> that is mostly used data structure after array, which allocates memory dynamically at run time that is it doesn’t require any size initialization as in case of array.</li>
<li>Linked List stores data in the forms of nodes, which is divided into two parts, first part stores the data and second part points to the next node by storing the address of that node.</li>
<li>We have first node which contains Data and Address to next node, and similarly second and third node forming a chain.</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/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="syntax" class="color-blue">Syntax</h2>
</div>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>To create code, pattern required is:</li>
</ul>
</div>
</div>
<div class="CodeContent" style="text-align: justify;">
<div class="hddn">
<figure class="highlight">
<pre><code id="code1" class="hljs javascript" data-lang=""><span class="nt">LinkedList<<span class="hljs-built_in">String</span>> linkedList=<span class="hljs-keyword">new</span> LinkedList<<span class="hljs-built_in">String</span>>()</span></code></pre>
</figure>
</div>
</div>
<div class="TextHeading">
<div class="hddn">
<h2 id="sample-code-in-java" class="color-purple" style="text-align: justify;">Sample Code in Java</h2>
<div class="code-embed-wrapper"> <div class="code-embed-infos"> </div> <pre class="language-java code-embed-pre line-numbers"  data-start="1" data-line-offset="0"><code class="language-java code-embed-code">import java.util.Iterator;<br/><br/>import java.util.LinkedList;					<br/><br/>public class LinkedListDemo <br/>{<br/><br/>  public static void main (String[] args) {<br/><br/>  LinkedList<String> linkedList=new LinkedList<String>();<br/><br/>  linkedList.add(&quot;java&quot;);<br/><br/>  linkedList.add(&quot;Is&quot;);<br/><br/>  linkedList.add(&quot;High&quot;);<br/><br/>  linkedList.add(&quot;Level&quot;);<br/><br/>  linkedList.add(&quot;Language&quot;);<br/><br/>  Iterator<String> itr=linkedList.iterator();<br/><br/>  while(itr.hasNext())<br/>  {<br/><br/>   System.out.print(itr.next());<br/><br/>   System.out.print(&quot;\t&quot;);<br/><br/>  }<br/><br/> }<br/><br/>}</code></pre> </div>
<div class="TextHeading" style="text-align: justify;">
<div class="hddn">
<h2 id="output" class="color-purple">Output</h2>
</div>
</div>
<div class="Output">
<div class="hddn">
<figure class="highlight" style="text-align: justify;">
<pre><code class="hljs" data-lang=""><span class="nt">java Is High Level Language</span></code></pre>
</figure>
</div>
</div>
</div>
</div>
]]></content:encoded>
					
					<wfw:commentRss>https://www.wikitechy.com/interview-questions/data-structure/how-to-make-linked-list-program-for-the-given-list/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<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’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<stdio.h><br/>#include <stdlib.h><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;, &head-> num);<br/>      if(first != 0)<br/>      {<br/>         temp->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;, &choice);<br/>   }<br/>   temp->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=>&quot;, temp->num);<br/>      count++;<br/>      temp = temp -> 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 <Type 0 or 1>?<br/>1<br/>Enter the data item: 20<br/>Do you want to continue<Type 0 or 1>?<br/>1<br/>Enter the data item: 30<br/>Do you want to continue<Type 0 or 1>?<br/>0<br/>Status of the Linked List is<br/>10=>20=>30=>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>
		<item>
		<title>How to remove duplicates from a sorted linked list ?</title>
		<link>https://www.wikitechy.com/interview-questions/data-structure/how-to-remove-duplicates-from-a-sorted-linked-list/</link>
					<comments>https://www.wikitechy.com/interview-questions/data-structure/how-to-remove-duplicates-from-a-sorted-linked-list/#respond</comments>
		
		<dc:creator><![CDATA[Editor]]></dc:creator>
		<pubDate>Tue, 13 Jul 2021 11:14:06 +0000</pubDate>
				<category><![CDATA[Data Structure]]></category>
		<category><![CDATA[Accenture interview questions and answers]]></category>
		<category><![CDATA[algorithm to remove duplicate elements from linked list]]></category>
		<category><![CDATA[Altimetrik India Pvt Ltd interview questions and answers]]></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[Collabera Te interview questions and answers]]></category>
		<category><![CDATA[Dell International Services India Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[find duplicates in linked list java]]></category>
		<category><![CDATA[Flipkart interview questions and answers]]></category>
		<category><![CDATA[geekyants 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[linked list algorithm]]></category>
		<category><![CDATA[linked list implementation in java]]></category>
		<category><![CDATA[linked list insertion]]></category>
		<category><![CDATA[linked list interview questions]]></category>
		<category><![CDATA[linked list program in java]]></category>
		<category><![CDATA[merge sort linked list]]></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[remove duplicates from linked list java]]></category>
		<category><![CDATA[remove duplicates from sorted linked list java]]></category>
		<category><![CDATA[remove duplicates from unsorted linked list]]></category>
		<category><![CDATA[reverse a linked lis]]></category>
		<category><![CDATA[reverse linked list java]]></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[Searches related to remove duplicates from unsorted linked list]]></category>
		<category><![CDATA[singly linked list]]></category>
		<category><![CDATA[sort linked list java]]></category>
		<category><![CDATA[sort linked listmerge two sorted linked lists]]></category>
		<category><![CDATA[Tech Mahindra interview questions and answers]]></category>
		<category><![CDATA[Tracxn Technologies Pvt Ltd interview questions and answers]]></category>
		<category><![CDATA[UnitedHealth Group interview questions and answers]]></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=476</guid>

					<description><![CDATA[Answer : To write a removeDuplicates() function which takes a list sorted...]]></description>
										<content:encoded><![CDATA[<div class="TextHeading">
<div class="hddn">
<h2 id="how-to-remove-duplicates-from-a-sorted-linked-list" class="color-pink" style="text-align: justify;">How to remove duplicates from a sorted linked list ?</h2>
</div>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>To write a removeDuplicates() function which takes a <a href="https://www.wikitechy.com/interview-questions/latex/what-are-the-list-of-latex/" target="_blank" rel="noopener">list</a> sorted from the list any duplicate nodes to be deleted. The list should be traversed only once.</li>
</ul>
</div>
</div>
<div class="TextHeading" style="text-align: justify;">
<div class="hddn">
<h2 id="algorithm" class="color-green">Algorithm</h2>
</div>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li>Traverse the head (or start) node from the list. Compare each node with its next node while <a href="https://www.wikitechy.com/technology/python-algorithm-circular-linked-list-traversal/" target="_blank" rel="noopener">traversing</a>.</li>
<li>If same as the current node and data of next node to be delete that node. Before we delete a node, we need to store next pointer of the node.</li>
</ul>
</div>
</div>
<div class="TextHeading" style="text-align: justify;">
<div class="hddn">
<h2 id="implementation" class="color-green">Implementation</h2>
</div>
</div>
<div class="Content" style="text-align: justify;">
<div class="hddn">
<ul>
<li><a href="https://www.wikitechy.com/tutorials/sql/functions-in-sql" target="_blank" rel="noopener">Functions</a> other than removeDuplicates() are just to create a linked.</li>
<li><a href="https://www.wikitechy.com/tutorials/java/java-linked-list" target="_blank" rel="noopener">Linked list</a> to be tested and removeDuplicates() from 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/how-to-remove-duplicates-from-a-sorted-linked-list.png" alt=" Remove Duplicate From a Sorting Linked List" /></div>
<div>
<h2 id="sample-code-in-java" class="color-blue" style="text-align: justify;">Sample Code in Java</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">class LinkedListExample <br/>{ <br/>	Node head; // head of list <br/><br/>	/* Linked list Node*/<br/>	class Node <br/>	{ <br/>		int data; <br/>		Node next; <br/>		Node(int d) {data = d; next = null; } <br/>	} <br/><br/>	void removeDuplicates() <br/>	{ <br/>		/*Another reference to head*/<br/>		Node current = head; <br/><br/>		/* Pointer to store the next pointer of a node to be deleted*/<br/>		Node next_next; <br/><br/>		/* do nothing if the list is empty */<br/>		if (head == null)	 <br/>			return; <br/><br/>		/* Traverse list till the last node */<br/>		while (current.next != null) { <br/><br/>			/*Compare current node with the next node */<br/>			if (current.data == current.next.data) { <br/>				next_next = current.next.next; <br/>				current.next = null; <br/>				current.next = next_next; <br/>			} <br/>			else // advance if no deletion <br/>			current = current.next; <br/>		} <br/>	} <br/>					<br/>	/* Utility functions */<br/><br/>	/* Inserts a new Node at front of the list. */<br/>	public void push(int new_data) <br/>	{ <br/>		/* 1 & 2: Allocate the Node & <br/>				Put in the data*/<br/>		Node new_node = new Node(new_data); <br/><br/>		/* 3. Make next of new Node as head */<br/>		new_node.next = head; <br/><br/>		/* 4. Move the head to point to new Node */<br/>		head = new_node; <br/>	} <br/><br/>	/* Function to print linked list */<br/>	void printList() <br/>	{ <br/>		Node temp = head; <br/>		while (temp != null) <br/>		{ <br/>			System.out.print(temp.data+&quot; &quot;); <br/>			temp = temp.next; <br/>		} <br/>		System.out.println(); <br/>	} <br/><br/>	/* Drier program to test above functions */<br/>	public static void main(String args[]) <br/>	{ <br/>		LinkedListExample wikitechylist = new LinkedListExample(); <br/>		wikitechylist.push(63); <br/>		wikitechylist.push(50); <br/>		wikitechylist.push(50); <br/>		wikitechylist.push(42); <br/>		wikitechylist.push(27); <br/>		wikitechylist.push(27); <br/>		<br/>		System.out.println(&quot;LinkedList before removal of duplicates&quot;); <br/>		wikitechylist.printList(); <br/>		<br/>		wikitechylist.removeDuplicates(); <br/>		<br/>		System.out.println(&quot;LinkedList after removal of elements&quot;); <br/>		wikitechylist.printList(); <br/>	} <br/>} </code></pre> </div>
<div class="Output" style="text-align: justify;">
<div class="hddn">
<figure class="highlight"><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">LinkedList before removal of duplicates<br/>27 27 42 50 50 63 <br/>LinkedList after removal of elements<br/>27 42 50 63</code></pre> </div></figure>
</div>
</div>
<div class="TextHeading" style="text-align: justify;">
<div class="hddn">
<h2 id="time-complexity" class="color-blue">Time Complexity</h2>
</div>
</div>
<div class="Content">
<div class="hddn">
<ul>
<li style="text-align: justify;">O(n) where n is number of nodes in the given linked list.</li>
</ul>
</div>
</div>
</div>
</div>
]]></content:encoded>
					
					<wfw:commentRss>https://www.wikitechy.com/interview-questions/data-structure/how-to-remove-duplicates-from-a-sorted-linked-list/feed/</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
