{"id":10173,"date":"2024-03-31T15:55:15","date_gmt":"2024-03-31T10:25:15","guid":{"rendered":"https:\/\/btechgeeks.com\/?p=10173"},"modified":"2024-04-01T15:56:18","modified_gmt":"2024-04-01T10:26:18","slug":"python-interview-questions-on-linked-list","status":"publish","type":"post","link":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/","title":{"rendered":"Python Interview Questions on Linked List"},"content":{"rendered":"<p>We have compiled most frequently asked\u00a0<a href=\"https:\/\/btechgeeks.com\/python-interview-questions\/\">Python Interview Questions<\/a>\u00a0which will help you with different expertise levels.<\/p>\n<h2>Python Interview Questions on Linked List<\/h2>\n<p>A linked list is a linear structure that consists of elements such that each element is an individual object and contains information regarding:<\/p>\n<ol>\n<li>Data<\/li>\n<li>Reference to next element<\/li>\n<\/ol>\n<p>In the linked list, each element is called a node.<\/p>\n<p><img loading=\"lazy\" class=\"alignnone size-full wp-image-10415\" src=\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png\" alt=\"Python Interview Questions on Linked List chapter 11 img 3\" width=\"437\" height=\"194\" srcset=\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png 437w, https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3-300x133.png 300w\" sizes=\"(max-width: 437px) 100vw, 437px\" \/><\/p>\n<p>You can see in the diagram, the reference to the first node is called Head. It is the entry point of the linked list. If the list is empty then the head points to null. The last node of the linked list refers to null.<\/p>\n<p>As the number of nodes can be increased or decreased as per requirement, linked lists are considered to be dynamic data structures. However, in a linked list direct access to data is not possible. Search for any item that starts from- the head and you will have to go through each reference to get that item. A linked list occupies more memory.<\/p>\n<p>The linked list described above is called a singly linked list. There is one more type of linked list known as a doubly-linked list. A double-linked list has a reference to the next node and the previous node.<\/p>\n<ul>\n<li><a href=\"https:\/\/btechgeeks.com\/java-program-to-remove-nodes-from-the-beginning-and-end-of-a-linked-list\/\">Java Program to Remove Nodes from the Beginning and End of a Linked List<\/a><\/li>\n<li><a href=\"https:\/\/btechgeeks.com\/singly-linked-list-insert-node\/\">Singly Linked List: How To Insert and Print Node<\/a><\/li>\n<li><a href=\"https:\/\/btechgeeks.com\/java-program-to-print-a-linked-list-in-reverse\/\">Java Program to Print a Linked List in Reverse<\/a><\/li>\n<\/ul>\n<p><img loading=\"lazy\" class=\"alignnone size-full wp-image-10416\" src=\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-4.png\" alt=\"Python Interview Questions on Linked List chapter 11 img 4\" width=\"404\" height=\"182\" srcset=\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-4.png 404w, https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-4-300x135.png 300w\" sizes=\"(max-width: 404px) 100vw, 404px\" \/><\/p>\n<p>Question 1.<br \/>\nWrite a code to implement a Node class such that a Node contains data as well as a reference to the next node.<br \/>\nAnswer:<br \/>\nTo create a node object we pass data value to the constructor. The constructor assigns the data value to data and sets the node\u2019s reference to None. Once we create all the objects we assign the memory address of the second object as the reference to the first node object, the memory address of the third object is assigned as a reference to the second object, and so on. The last object, thus have no(or none as) reference.<\/p>\n<p>The code for the <strong>Node<\/strong> class will be as follows:<\/p>\n<p>Code<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n        def__init__(self,data = None):\r\n            self . data = data\r\n            self . reference = None\r\nobjNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\nobjNode1 . reference = objNode2\r\nobjNode2 . reference = objNode3\r\nobjNode3 . reference = objNode4\r\nobjNode4 . reference = None<\/pre>\n<p><strong>Execution<\/strong><\/p>\n<pre>print(\"DATA VALUE = \",objNodel.data,\"REFERENCE = \",objNodel.reference)\r\nprint(\"DATA VALUE = \",objNode2.data,\"REFERENCE = \",objNode2.reference)\r\nprint(\"DATA VALUE = \",objNode3.data,\"REFERENCE = \",objNode3.reference)\r\nprint(\"DATA VALUE = \",objNode4.data,\"REFERENCE = \u201d,objNode4.reference)<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">DATA VALUE = 1 REFERENCE = &lt;_main_. Node object\r\nat 0x000000595E0CC6A0&gt;\r\nDATA VALUE = 2 REFERENCE =&lt;_main_ .Node object\r\nat 0x000000595E329978&gt;\r\nDATA VALUE = 3 REFERENCE = &lt;_main_ .Node object\r\nat 0x000000595E3299B0&gt;\r\nDATA VALUE = 4 REFERENCE = None\r\n&gt;&gt;&gt;<\/pre>\n<p>Question 2.<br \/>\nWrite code to traverse through a linked list.<br \/>\nAnswer:<br \/>\n<strong>Method I<\/strong><br \/>\nWe have already written the code for the <strong>Node<\/strong> class:<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n      def _init_ (self,data = None):\r\n          self.data = data\r\n          self.reference = None\r\n\r\nobjNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)<\/pre>\n<p>We will now see how to traverse through the linked list:<\/p>\n<p><strong>Step 1<\/strong><br \/>\nWe create a variable <strong>presentNode<\/strong> and assign the first object to it.<\/p>\n<pre>presentNode = objNode1<\/pre>\n<p>On doing this <strong>presentNode<\/strong> gets the data and reference values of <strong>objectNode1<\/strong>.<br \/>\n<strong>Step 2<\/strong><br \/>\nThe reference value points to <strong>objNode2<\/strong>.<br \/>\nSo, we can write a while loop:<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">while presentNode:\r\nprint(\"DATA VALUE = \",presentNode.data)\r\npresentNode = presentNode.reference<\/pre>\n<p>Once the <strong>presentNode<\/strong> is assigned, the reference value contained in <strong>objNode4<\/strong> it will come out of the while loop because the value of reference is None.<\/p>\n<p><strong>Code<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n       def_init_(self,data = None):\r\n           self.data = data\r\n           self.reference = None<\/pre>\n<p><strong>Execution<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\nobjNodel.reference = objNode2\r\nobjNode2.reference = objNode3\r\nobjNode3.reference = objNode4\r\nobjNode4.reference = None\r\npresentNode = objNode1\r\nwhile presentNode:\r\n    print(\"DATA VALUE = \",presentNode.data)\r\n    presentNode = presentNode.reference<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre>DATA VALUE = 1\r\nDATA VALUE = 2\r\nDATA VALUE = 3\r\nDATA VALUE = 4<\/pre>\n<p><strong>Method II<\/strong><br \/>\nAnother method to do this by creating two classes: Node and Linked list<br \/>\n<strong>Code<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n      def_init_(self,data = None):\r\n          self.data = data\r\n          self.reference = None\r\nclass Linked_list:\r\n     def_init_(self):\r\n        self.head = None \r\n     def traverse(self) :\r\n           presentNode = self.head\r\n           while presentNode:\r\n                  print(\"DATA VALUE = \",presentNode.data)\r\n                  presentNode = presentNode.reference<\/pre>\n<p><strong>Execution<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\nlinkObj = Linked_list( )\r\n#head of the linked list to first object\r\nlinkObj.head = objNodel\r\n# reference of the first node object to second object\r\n\r\nlinkObj.head.reference = objNode2\r\nobjNode2.reference = objNode3\r\nobjNode3.reference = objNode4\r\nlinkObj.traverse ( )<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre>DATA VALUE = 1\r\nDATA VALUE = 2\r\nDATA VALUE = 3\r\nDATA VALUE = 4<\/pre>\n<p>Question 3.<br \/>\nWrite a code to add a node at the beginning of a linked list.<br \/>\nAnswer:<br \/>\nTo solve this question, we will just add a new method to insert the node in the same code that is mentioned in the last example:<br \/>\nIn the last example, we pointed the head of the linked list object to the first node object.<\/p>\n<pre>linkObj.head = objNode1<\/pre>\n<p>When we add the node at the beginning we just have to make the <strong>linkObj<\/strong>.<br \/>\n<strong>head = new_node and new node.reference = obj_Node1<\/strong>.<\/p>\n<p>For this, we write a code where the value of the <strong>linkObj.head<\/strong> is first passed on to the new node. reference and then <strong>linkObj.head<\/strong> is set to the new node object.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">def insert_at_Beginning(self, data) :\r\nnew_data = Node(data)\r\nnew_data.reference = self.head\r\nself.head = new_data<\/pre>\n<p>So, the full code would be like the following:<\/p>\n<p><strong>Code<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n     def_init_(self,data = None):\r\n          self.data = data\r\n          self.reference = None\r\nclass Linked_list:\r\n   def_init_(self) :\r\n         self.head = None\r\n  def traverse(self):\r\n       presentNode = self.head\r\n       while presentNode:\r\n            print(\"DATA VALUE = \",presentNode.data)\r\n            presentNode = presentNode.reference\r\n def insert_at_Beginning(self, data) :\r\n       new_data = Node(data)\r\n       new_data.reference = self.head\r\n       self.head = new data<\/pre>\n<p><strong>Execution<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(l1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\nlinkObj = Linked_list( )\r\n#head of the linked list to first object\r\nlinkObj.head = objNode1\r\n# reference of the first node object to second object\r\nlinkObj.head.reference = objNode2\r\nobjNode2.reference = objNode3\r\nobjNode3.reference = objNode4\r\nlinkObj.insert_at_Beginning(5)\r\nlinkObj.traverse ( )<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre>DATA VALUE = 5\r\nDATA VALUE = 1\r\nDATA VALUE = 2\r\nDATA VALUE = 3\r\nDATA VALUE = 4<\/pre>\n<p>Question 4.<br \/>\nWrite a code to add a node at the end of a linked list.<br \/>\nAnswer.<br \/>\nIn order to add a node at the end of the linked list, it is important that you point the reference of the last node to the new node that you create.<br \/>\n<strong>Step 1:<\/strong><\/p>\n<p><strong>Define the function<\/strong><\/p>\n<pre>def insert_at_end(self,data):<\/pre>\n<p><strong>Step 2:<\/strong><\/p>\n<p><strong>Create a new Node object<\/strong><\/p>\n<pre>new_data = Node(data)<\/pre>\n<p><strong>Step 3:<\/strong><\/p>\n<p><strong>Traverse through the linked list to reach the last node<\/strong><br \/>\nRemember that you cannot directly access the last node in the linked list. You will have to traverse through all the nodes and reach the last node in order to take the next step.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">presentNode = self.head\r\n             while presentNode.reference != None:\r\n                   presentNode = presentNode.reference<\/pre>\n<p><strong>Step 4:<\/strong><\/p>\n<p><strong>Add the new node at the end<\/strong><\/p>\n<p>After traversing through the linked list, you know that you have reached the last node whenpresentNode.reference = None. Since this won\u2019t remain the last node anymore, you need to:<\/p>\n<pre>presentNode.reference = new_data<\/pre>\n<p>With this, we have added a new node at the end of a linked list.<\/p>\n<p><strong>Code<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n    def_init_(self,data = None):\r\n          self.data = data\r\n          self.reference = None\r\nclass Linked_list:\r\n   def_init_(self):\r\n         self.head = None\r\n   def traverse(self):\r\n       presentNode = self.head\r\n       while presentNode:\r\n             print(\"DATA VALUE = \",presentNode.data)\r\n             presentNode = presentNode.reference\r\n  def insert_at_end(self,data):\r\n      new_data = Node(data)\r\n      presentNode = self.head\r\n      while presentNode.reference != None:\r\n          presentNode = presentNode.reference\r\n      presentNode.reference = new_data<\/pre>\n<p><strong>Execution<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\nlinkObj = Linked_list( )\r\n#head of the linked list to first object\r\nlinkObj.head = objNode1\r\n# reference of the first node object to second object\r\nlinkObj.head.reference = objNode2\r\nobjNode2.reference = objNode3\r\nobjNode3.reference = objNode4\r\nlinkObj.insert_at_end(5)\r\nlinkObj.insert_at_end(6)\r\nlinkObj.insert_at_end(7)\r\nlinkObj.traverse( )<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre>DATA VALUE = 1\r\nDATA VALUE = 2\r\nDATA VALUE = 3\r\nDATA VALUE = 4\r\nDATA VALUE = 5\r\nDATA VALUE = 6\r\nDATA VALUE = 7<\/pre>\n<p>Question 5.<br \/>\nWrite a code to insert a node between two nodes in a linked list.<br \/>\nAnswer:<br \/>\nThe solution for this problem is very similar to adding a node to the beginning. The only difference is that when we add a node at the beginning we point the head value to the new node whereas in this case, the function will take two parameters. First will be the node object after which the new object will be inserted and the second would be the data for the new object. Once the new node is created, we pass on the reference value stored in the existing node object to it and the existing node is then made to point at the new node object<\/p>\n<p><strong>Step 1:<\/strong><\/p>\n<p><strong>Define the function<\/strong><\/p>\n<p>This function will take two parameters:<\/p>\n<ol>\n<li>The node object after which the data is to be inserted.<\/li>\n<li>Data for the new node object.<\/li>\n<\/ol>\n<pre>def insert_in_middle(self,insert_data,new_data):<\/pre>\n<p><strong>Step 2:<\/strong><br \/>\nAssign references<\/p>\n<pre>new_node = Node(new_data)\r\nnew_node.reference = insert_data.reference insert_data.reference = new_node<\/pre>\n<p><strong>Code<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n\u00a0 \u00a0 \u00a0 def_init_(self,data = None):\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0self.data = data\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0self.reference = None\r\nclass Linked_list:\r\ndef_init_(self):\r\nself.head = None\r\ndef traverse(self):\r\npresentNode = self.head\r\nwhile presentNode:\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 print(\"DATA VALUE = \",presentNode.data)\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 presentNode = presentNode.reference\r\n\r\n\r\ndef insert_in_middle(self,insert_data,new_data):\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0new_node = Node(new_data)\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 new_node.reference = insert_data.reference insert_data.reference = new_node<\/pre>\n<p><strong>Execution<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\nlinkObj = Linked_list()\r\n#head of the linked list to first object\r\nlinkObj.head = objNodel\r\n# reference of the first node object to second object\r\nlinkObj.head.reference = objNcde2\r\n\r\nobjNode2.reference = objNode3\r\nobjNode3.reference = objNode4\r\nlinkObj.insert_in_middle(objNode3,8)\r\nlinkObj.traverse ( )<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre>DATA VALUE = 1\r\nDATA VALUE = 2\r\nDATA VALUE = 3\r\nDATA VALUE = 8\r\nDATA VALUE = 4\r\n&gt;&gt;&gt;<\/pre>\n<p>Question 6.<br \/>\nWrite code to remove a node from a linked list.<br \/>\nAnswer:<br \/>\nSuppose we have a linked list as shown below:<br \/>\nA -&gt; B -&gt; C<br \/>\nA. reference = B<br \/>\nB. reference = C<br \/>\nC. reference = A.<br \/>\nTo remove B, we traverse through the linked list. When we reach node A that has a reference pointing to B, we replace that value with the reference value stored in B(that points to C). So that will make A point to C and B is removed from the chain.<br \/>\nThe function code will be as follows:<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">def remove(self,removeObj):\r\n presentNode = self.head\r\n  while presentNode:\r\n    if(presentNode.reference == removeObj):\r\n       presentNode.reference = removeObj.reference\r\n           presentNode = presentNode.reference<\/pre>\n<p>The function takes the <strong>Node<\/strong> object as a parameter and traverses through the linked list, till it reaches the object that needs to be removed. Once we reach the node that has reference to the node that has to be removed, we simply change the reference value to reference value stored in object removeobj. Thus, the node now points directly to the node after the <strong>removeObj<\/strong>.<\/p>\n<p><strong>Code<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n\u00a0 def_init_(self,data = None):\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0self.data = data\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0self.reference = None\r\nclass Linked_list:\r\n\u00a0 def_init_(self) :\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0self.head = None\r\n\u00a0 def traverse(self):\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 presentNode = self.head\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 while presentNode:\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0print(\"DATA VALUE = \",presentNode.data)\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0presentNode = presentNode.reference\r\n\r\n\r\ndef remove(self,removeObj):\r\n\u00a0 \u00a0 \u00a0 presentNode = self.head\r\n\u00a0 \u00a0 \u00a0 \u00a0while presentNode:\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0if(presentNode.reference == removeObj):\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0presentNode.reference = removeObj.\r\nreference\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0presentNode = presentNode.reference<\/pre>\n<p><strong>Execution<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\nlinkObj = Linked_list( )\r\n#head of the linked list to first object\r\nlinkObj.head = objNode1\r\n# reference of the first node object to second object\r\nlinkObj.head.reference = objNode2\r\nobjNode2.reference = objNode3\r\nobjNode3.reference = objNode4\r\nlinkObj.remove(objNode2)\r\nlinkObj.traverse( )<\/pre>\n<p>Question 7.<br \/>\nPrint the values of the node in the center of the linked list.<br \/>\nAnswer:<br \/>\nThis involves counting the number of nodes in the object. If the length is even then the data of two nodes in the middle should be printed else only the data of the node in the center should be printed.<\/p>\n<p><strong>Step 1:<\/strong><\/p>\n<p><strong>Define the function<\/strong><\/p>\n<pre>def find_middle (self, 1list) :<\/pre>\n<p><strong>Step 2:<\/strong><\/p>\n<p><strong>Find the length of the counter<\/strong><\/p>\n<p>Here, we set a variable counter = 0. As we traverse through the linked list we increment the counter. At the end of the while loop we get the count of the number of nodes in the linked list. This is also the length of the linked list.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">counter = 0\r\n          presentNode = self.head\r\n          while presentNode:\r\n                 presentNode = presentNode.reference\r\n                  counter = counter + 1 .\r\n          print(\"size of linked list = \", counter)<\/pre>\n<p><strong>Step 3:<\/strong><\/p>\n<p><strong>Reach the middle of the linked list<\/strong><\/p>\n<p>The reference to the node in the middle is stored in the node before that. So, in the for loop instead of iterating (counter\/2) times, we iterate (counter-1)\/2 times. This brings us to the node which is placed just before the centre value.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">presentNode = self.head\r\nfor i in range((counter-1)112) :\r\npresentNode = presentNode.reference<\/pre>\n<p><strong>Step 4:<\/strong><\/p>\n<p><strong>Display the result depending on whether the number of nodes in the linked list<\/strong><\/p>\n<p>If the linked list has an even number of nodes then print the value of reference stored in the present node and the next node.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">if (counter%2 == 0):\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 nextNode = presentNode.reference\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 print (\"Since the length of linked list is an even number the two midle elements are:\")\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 print(presentNode.data,nextNode.data)<\/pre>\n<p>Else, print the value of the present node.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">else:\u00a0\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 print(\"Since the length of the linked list is an odd number, the middle element is: \")\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0print(presentNode.data)<\/pre>\n<p><strong>Code<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n     def_init_(self,data = None):\r\n           self.data = data\r\n           self.reference = None\r\nclass Linked_list:\r\n    def_init_(self):\r\n          self.head = None\r\ndef find_middle (self, Hist) :\r\n     counter = 0\r\n     presentNode = self.head\r\n    while presentNode:\r\n         presentNode = presentNode.reference\r\n         counter = counter + 1\r\n    print (\"size of linked list = \", counter)\r\n    presentNode = self.head\r\n    for i in range((counter-1)112) :\r\n        presentNode = presentNode.reference\r\n   if (counter%2 == 0) :\u00a0\r\n          nextNode = presentNode.reference\r\n          print(\"Since the length of linked list is an even number the two midle elements are:\")\r\n         print(presentNode.data,nextNode.data)\r\n\r\n\r\n     else:\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 print(\"Since the length of the linked list is an odd number, the middle element is: \")\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0print(presentNode.data)\r\n<\/pre>\n<p><strong>Execution (Odd Number of Nodes)<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\nobjNode5 = Node(5)\r\nlinkObj = Linked_list( )\r\n#head of the linked list to first object\r\nlinkObj.head = objNode1\r\n# reference of the first node object to second object\r\nlinkObj.head.reference = objNode2\r\nobjNode2.reference = objNode3\r\nobjNode3.reference = objNode4\r\nobjNode4.reference = objNode5\r\nlinkObj .find_middle (linkObj )<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre>size of linked list = 5\r\nSince the length of the linked list is an odd \r\nnumber, the middle element is:\r\n3<\/pre>\n<p><strong>Execution (Even Numbers)<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\u00a0\r\nlinkObj = Linked_list( )\r\n#head of the linked list to first object\r\nlinkObj.head = objNodel\r\n# reference of the first node object to second object\r\nlinkObj.head.reference = objNode2\r\nobjNode2.reference = objNode3\r\nobjNode3.reference = objNode4\r\nlinkObj .find_middle (linkObj )<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre>size of linked list = 4\r\nSince the length of the linked list is an even number the two middle elements are:\r\n2\u00a0 3<\/pre>\n<p>Question 8.<br \/>\nImplement a doubly linked list.<br \/>\nAnswer:<br \/>\nA doubly linked list has three parts:<\/p>\n<ol>\n<li>Pointer to the previous node<\/li>\n<li>Data<\/li>\n<li>Pointer to the next node<\/li>\n<\/ol>\n<p>Implementation of a doubly linked list is easy. We just need to take care of one thing that each node is connected to the next and the previous data.<\/p>\n<p><strong>Step 1:<\/strong><\/p>\n<p><strong>Create a Node Class<\/strong><\/p>\n<p>The node class will have a constructor that initializes three parameters: data, reference to next node &#8211; refNext and reference to previous node &#8211; refPrev.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 def_init_(self,data = None):\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 self.data = data\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 self.refNext = None\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 self.refPrev = None<\/pre>\n<p><strong>Step 2:<\/strong><\/p>\n<p><strong>Create functions to traverse through the double linked list <\/strong><\/p>\n<p><strong>I. Traverse Forward<\/strong><\/p>\n<p>To: traverse forward with the help of <strong>refNext<\/strong> that points to next value of the linked list. We start with the head and move on to the next node using<br \/>\n<strong>refNext.<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">def traverse(self):\r\npresentNode = self.head\r\nwhile presentNode:\r\nprint(\"DATA VALUE = \",presentNode.data)\r\npresentNode = presentNode.refNext<\/pre>\n<p><strong>II. Traverse Reverse<\/strong><\/p>\n<p>The traverse reverse is the opposite of the traverse forward. We are able to traverse backward with the help of the value of <strong>refPrev<\/strong> because it points to the previous node. We start from the tail and move on to the previous node using<br \/>\n<strong>refPrev<\/strong>.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">def traverseReverse(self):\r\npresentNode = self.tail\r\nwhile presentNode:\r\n\u00a0 \u00a0 \u00a0 \u00a0 print(\"DATA VALUE = \",presentNode.data)\r\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0presentNode = presentNode.refPrev<\/pre>\n<p><strong>Step 3:<\/strong><\/p>\n<p><strong>Write a function to add a node at the end<\/strong><\/p>\n<p>Appending a node at the end of the doubly linked list is the same as appending in the linked list the only difference is that we have to ensure that the node that is appended has its <strong>refPrev<\/strong> pointing to the node after which it has been added.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">def append(self,data):\r\nnew_data = Node(data)\r\npresentNode = self.head\r\nwhile presentNode.refNext != None:\r\npresentNode = presentNode.refNext\r\npresentNode.refNext = new_data\r\nnew_data.refPrev = presentNode<\/pre>\n<p><strong>Step 4:<\/strong><\/p>\n<p><strong>Write a function to remove a node<\/strong><\/p>\n<p>This function takes the node object that needs to be removed as a parameter. In order to remove a node, we iterate through the doubly linked list twice. We first start with the head and move forward using <strong>refNext<\/strong> and when we encounter the object that needs to be removed we change the <strong>refNext<\/strong> value of the present node (which is presently pointing to the object that needs to be removed) to the node that comes after the object that needs to be removed. We then traverse through the linked list backward starting from the tail and when we encounter the object to be removed again we change the<strong> refPrev<\/strong> value of the present node to the node that is placed before it.<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">def remove(self,removeObj):\r\npresentNode = self.head\r\npresentNodeTail = self.tail\r\nwhile presentNode.refNext != None:\r\n     if(presentNode.refNext == removeObj):\r\n          presentNode.refNext = removeObj.refNext\r\n     presentNode = presentNode.refNext\r\n while presentNodeTail.refPrev != None:\r\n    if(presentNodeTail.refPrev == removeObj):\r\n        presentNodeTail.refPrev = removeObj.\r\nrefPrev\r\n      presentNodeTail = presentNodeTail.refPrev<\/pre>\n<p><strong>Code<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\n  def_init_(self,data = None):\r\n      self.data = data\r\n      self.refNext = None\r\n      self.refPrev = None\r\nclass dLinked_list:\r\n def_init_(self)':\r\n      self.head = None\r\n      self.tail = None\r\ndef append(self, data) :\r\n    new_data = Node(data)\r\n    presentNode = self.head\r\n    while presentNode.refNext != None:\r\n         presentNode = presentNode.refNext\r\n        presentNode.refNext = new_data\r\n        new_data.refPrev = presentNode\r\n       self.tail = new data\r\n\r\n\r\ndef traverse(self):\r\n     presentNode = self.head\r\n     while presentNode:\r\n        print(\"DATA VALUE = \",presentNode.data)\r\n        presentNode = presentNode.refNext\r\n\r\n\r\ndef traverseReverse(self):\r\n    presentNode = self.tail\r\n    while presentNode:\r\n          print(\"DATA VALUE = \",presentNode.data)\r\n          presentNode = presentNode.refPrev\r\ndef remove(self,removeObj):\r\n    presentNode = self.head\r\n    presentNodeTail = self.tail\r\n    while presentNode.refNext != None:\r\n       if (presentNode.refNext == removeObj):\r\n           presentNode.refNext = removeObj.\r\nrefNext\r\n          presentNode = presentNode.refNext\r\n   while presentNodeTail.refPrev != None:\r\n          if (presentNodeTail.refPrev ==\r\nremoveObj):\r\n         presentNodeTail.refPrev = removeObj.\r\nrefPrev\r\n        presentNodeTail = presentNodeTail.\r\nrefPrev\r\n<\/pre>\n<p><strong>Execution<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nObjNode4 = Node(4)\r\ndlinkObj = dLinked_list( )\r\n#head of the linked list to first object\r\ndlinkObj.head = objNode1\r\ndlinkObj.tail = objNode4\r\n# reference of the first node object to second object\r\ndlinkObj.head.refNext = objNode2\r\ndlinkObj.tail.refPrev = objNode3\r\nobjNode2.refNext = objNode3\r\nobjNode3.refNext = objNode4\r\nobjNode4.refPrev = objNode3\r\nobjNode3.refPrev = objNode2\r\nobjNode2.refPrev = objNode1\r\nprint(\"Appending Values\")\r\ndlinkObj.append(8)\r\ndlinkObj.append(9)\r\nprint(\"traversing forward after Append\")\r\ndlinkObj.traverse( )\r\nprint(\"traversing reverse after Append\")\r\ndlinkObj.traverseReverse( )\r\nprint(\"Removing Values\")\r\ndlinkObj.remove(objNode2)\r\nprint(\"traversing forward after Remove\")\r\ndlinkObj.traverse( )\r\nprint(\"traversing reverse after Remove\")\r\ndlinkObj.traverseReverse( )<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\ndlinkObj = dLinked_list( )\r\n#head of the linked list to first object\r\ndlinkObj.head = objNode1\r\ndlinkObj.tail = objNode4\r\n# reference of the first node object to second object\r\ndlinkObj.head.refNext = objNode2\r\ndlinkObj.tail.refPrev = objNode3\r\nobjNode2.refNext = objNode3\r\nobjNode3.refNext = objNode4\r\nobjNode4.refPrev = objNode3\r\nobjNode3.refPrev = objNode2\r\nobjNode2.refPrev = objNode1\r\nprint(\"Appending Values\")\r\ndlinkObj.append(8)\r\ndlinkObj.append(9)\r\nprint(\"traversing forward after Append\")\r\ndlinkObj.traverse( )\r\nprint(\"traversing reverse after Append\")\r\ndlinkObj.traverseReverse( )\r\nprint(\"Removing Values\")\r\ndlinkObj.remove(objNode2)\r\nprint(\"traversing forward after Remove\")\r\ndlinkObj.traverse( )\r\nprint(\"traversing reverse after Remove\")\r\ndlinkObj.traverseReverse( )<\/pre>\n<p>Question 9.<br \/>\nWrite code to reverse a linked list.<br \/>\nAnswer:<br \/>\nTo reverse a linked list we have to reverse the pointers. Look at the figure shown below. The first table shows how information is stored in the linked list. The second table shows how the parameters are initialized in the <strong>reverse( )<\/strong> function before beginning to traverse through the list and reversing the elements.<\/p>\n<p><img loading=\"lazy\" class=\"alignnone size-full wp-image-10259\" src=\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-1.png\" alt=\"Python Interview Questions on Linked List chapter 11 img 1\" width=\"498\" height=\"143\" srcset=\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-1.png 498w, https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-1-300x86.png 300w\" sizes=\"(max-width: 498px) 100vw, 498px\" \/><\/p>\n<p>We then use the following while loop:<\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">while nextval != None:\r\npresentNode.refNext = previous\r\nprevious = presentNode\r\npresentNode = nextval\r\nnextval = nextval.refNext\r\npresentNode.refNext = previous\r\nself.head = presentNode<\/pre>\n<p>This is how the while loop works:<\/p>\n<p><img loading=\"lazy\" class=\"alignnone size-full wp-image-10261\" src=\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-2.png\" alt=\"Python Interview Questions on Linked List chapter 11 img 2\" width=\"527\" height=\"232\" srcset=\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-2.png 527w, https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-2-300x132.png 300w\" sizes=\"(max-width: 527px) 100vw, 527px\" \/><\/p>\n<p>You can see as we iterate through the while loop how the values of <strong>presentnode.refNext<\/strong> change. Node1 that was earlier pointing to node2 changes its pointer to none. Same way node2 changes its pointer value to node1, and so on.<br \/>\n<strong>Code<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">class Node:\r\ndef_init_(self,data = None):\r\n\u00a0 \u00a0 \u00a0 self.data = data\r\n\u00a0 \u00a0 \u00a0 self.refNext = None\r\nclass Linked_list:\r\n\u00a0 \u00a0 \u00a0def init (self) :\r\n\u00a0 \u00a0 \u00a0self.head = None\r\n\r\n\r\ndef reverse(self):\r\n     previous = None\r\n     presentNode = self.head\r\n     nextval = presentNode.refNext\r\n     while nextval != None:\r\n           presentNode.refNext = previous\r\n           previous = presentNode\r\n           presentNode = nextval\r\n           nextval = nextval.refNext\r\n    presentNode.refNext = previous\r\n    self.head = presentNode\r\ndef traverse(self) :\r\n    presentNode = self.head\r\n   while presentNode:\r\n     print(\"DATA VALUE = \",presentNode.data)\r\n     presentNode = presentNode.refNext\r\n<\/pre>\n<p><strong>Execution<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">objNode1 = Node(1)\r\nobjNode2 = Node(2)\r\nobjNode3 = Node(3)\r\nobjNode4 = Node(4)\r\nlinkObj = Linked_list( )\r\n#head of the linked list to first object\r\nlinkObj.head = objNode1\r\n# reference of the first node object to second object\r\nlinkObj.head.refNext = objNode2\r\nobj'Node2 . refNext = objNode3\r\nobjNode3.refNext = objNode4\r\nprint(\"traverse before reversing\")\r\nlinkObj.traverse( )\r\nlinkObj.reverse( )\r\nprint(\"traverse after reversing\")\r\nlinkObj.traverse( )<\/pre>\n<p><strong>Output<\/strong><\/p>\n<pre>traverse before reversing\r\nDATA VALUE = 1\r\nDATA VALUE = 2\r\nDATA VALUE = 3\r\nDATA VALUE = 4\r\ntraverse after reversing\r\nDATA VALUE = 4\r\nDATA VALUE = 3\r\nDATA VALUE = 2\r\nDATA VALUE = 1<\/pre>\n<p>&nbsp;<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>We have compiled most frequently asked\u00a0Python Interview Questions\u00a0which will help you with different expertise levels. Python Interview Questions on Linked List A linked list is a linear structure that consists of elements such that each element is an individual object and contains information regarding: Data Reference to next element In the linked list, each element &#8230; <a title=\"Python Interview Questions on Linked List\" class=\"read-more\" href=\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/\" aria-label=\"More on Python Interview Questions on Linked List\">Read more<\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":""},"categories":[5],"tags":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v17.2 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Python Interview Questions on Linked List - BTech Geeks<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Python Interview Questions on Linked List - BTech Geeks\" \/>\n<meta property=\"og:description\" content=\"We have compiled most frequently asked\u00a0Python Interview Questions\u00a0which will help you with different expertise levels. Python Interview Questions on Linked List A linked list is a linear structure that consists of elements such that each element is an individual object and contains information regarding: Data Reference to next element In the linked list, each element ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/\" \/>\n<meta property=\"og:site_name\" content=\"BTech Geeks\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/btechgeeks\" \/>\n<meta property=\"article:published_time\" content=\"2024-03-31T10:25:15+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-04-01T10:26:18+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@btech_geeks\" \/>\n<meta name=\"twitter:site\" content=\"@btech_geeks\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prasanna\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"17 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Organization\",\"@id\":\"https:\/\/btechgeeks.com\/#organization\",\"name\":\"BTech Geeks\",\"url\":\"https:\/\/btechgeeks.com\/\",\"sameAs\":[\"https:\/\/www.facebook.com\/btechgeeks\",\"https:\/\/www.instagram.com\/btechgeeks\/\",\"https:\/\/www.linkedin.com\/in\/btechgeeks\",\"https:\/\/www.youtube.com\/channel\/UC9MlCqdJ3lKqz2p5114SDIg\",\"https:\/\/in.pinterest.com\/btechgeek\/\",\"https:\/\/twitter.com\/btech_geeks\"],\"logo\":{\"@type\":\"ImageObject\",\"@id\":\"https:\/\/btechgeeks.com\/#logo\",\"inLanguage\":\"en-US\",\"url\":\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png\",\"contentUrl\":\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png\",\"width\":350,\"height\":70,\"caption\":\"BTech Geeks\"},\"image\":{\"@id\":\"https:\/\/btechgeeks.com\/#logo\"}},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/btechgeeks.com\/#website\",\"url\":\"https:\/\/btechgeeks.com\/\",\"name\":\"BTech Geeks\",\"description\":\"Lecture Notes for BTech, BSc Students\",\"publisher\":{\"@id\":\"https:\/\/btechgeeks.com\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/btechgeeks.com\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"ImageObject\",\"@id\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#primaryimage\",\"inLanguage\":\"en-US\",\"url\":\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png\",\"contentUrl\":\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png\",\"width\":437,\"height\":194,\"caption\":\"Python Interview Questions on Linked List chapter 11 img 3\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#webpage\",\"url\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/\",\"name\":\"Python Interview Questions on Linked List - BTech Geeks\",\"isPartOf\":{\"@id\":\"https:\/\/btechgeeks.com\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#primaryimage\"},\"datePublished\":\"2024-03-31T10:25:15+00:00\",\"dateModified\":\"2024-04-01T10:26:18+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/btechgeeks.com\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Python Interview Questions on Linked List\"}]},{\"@type\":\"Article\",\"@id\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#webpage\"},\"author\":{\"@id\":\"https:\/\/btechgeeks.com\/#\/schema\/person\/ea8ce699662f0d7e248e52fe080b85bb\"},\"headline\":\"Python Interview Questions on Linked List\",\"datePublished\":\"2024-03-31T10:25:15+00:00\",\"dateModified\":\"2024-04-01T10:26:18+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#webpage\"},\"wordCount\":1800,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/btechgeeks.com\/#organization\"},\"image\":{\"@id\":\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png\",\"articleSection\":[\"Python\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#respond\"]}]},{\"@type\":\"Person\",\"@id\":\"https:\/\/btechgeeks.com\/#\/schema\/person\/ea8ce699662f0d7e248e52fe080b85bb\",\"name\":\"Prasanna\",\"image\":{\"@type\":\"ImageObject\",\"@id\":\"https:\/\/btechgeeks.com\/#personlogo\",\"inLanguage\":\"en-US\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/174540ad43736c7d1a4c4f83c775e74d?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/174540ad43736c7d1a4c4f83c775e74d?s=96&d=mm&r=g\",\"caption\":\"Prasanna\"},\"url\":\"https:\/\/btechgeeks.com\/author\/prasanna\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Python Interview Questions on Linked List - BTech Geeks","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/","og_locale":"en_US","og_type":"article","og_title":"Python Interview Questions on Linked List - BTech Geeks","og_description":"We have compiled most frequently asked\u00a0Python Interview Questions\u00a0which will help you with different expertise levels. Python Interview Questions on Linked List A linked list is a linear structure that consists of elements such that each element is an individual object and contains information regarding: Data Reference to next element In the linked list, each element ... Read more","og_url":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/","og_site_name":"BTech Geeks","article_publisher":"https:\/\/www.facebook.com\/btechgeeks","article_published_time":"2024-03-31T10:25:15+00:00","article_modified_time":"2024-04-01T10:26:18+00:00","og_image":[{"url":"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png"}],"twitter_card":"summary_large_image","twitter_creator":"@btech_geeks","twitter_site":"@btech_geeks","twitter_misc":{"Written by":"Prasanna","Est. reading time":"17 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Organization","@id":"https:\/\/btechgeeks.com\/#organization","name":"BTech Geeks","url":"https:\/\/btechgeeks.com\/","sameAs":["https:\/\/www.facebook.com\/btechgeeks","https:\/\/www.instagram.com\/btechgeeks\/","https:\/\/www.linkedin.com\/in\/btechgeeks","https:\/\/www.youtube.com\/channel\/UC9MlCqdJ3lKqz2p5114SDIg","https:\/\/in.pinterest.com\/btechgeek\/","https:\/\/twitter.com\/btech_geeks"],"logo":{"@type":"ImageObject","@id":"https:\/\/btechgeeks.com\/#logo","inLanguage":"en-US","url":"https:\/\/btechgeeks.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png","contentUrl":"https:\/\/btechgeeks.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png","width":350,"height":70,"caption":"BTech Geeks"},"image":{"@id":"https:\/\/btechgeeks.com\/#logo"}},{"@type":"WebSite","@id":"https:\/\/btechgeeks.com\/#website","url":"https:\/\/btechgeeks.com\/","name":"BTech Geeks","description":"Lecture Notes for BTech, BSc Students","publisher":{"@id":"https:\/\/btechgeeks.com\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/btechgeeks.com\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"ImageObject","@id":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#primaryimage","inLanguage":"en-US","url":"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png","contentUrl":"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png","width":437,"height":194,"caption":"Python Interview Questions on Linked List chapter 11 img 3"},{"@type":"WebPage","@id":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#webpage","url":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/","name":"Python Interview Questions on Linked List - BTech Geeks","isPartOf":{"@id":"https:\/\/btechgeeks.com\/#website"},"primaryImageOfPage":{"@id":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#primaryimage"},"datePublished":"2024-03-31T10:25:15+00:00","dateModified":"2024-04-01T10:26:18+00:00","breadcrumb":{"@id":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/btechgeeks.com\/"},{"@type":"ListItem","position":2,"name":"Python Interview Questions on Linked List"}]},{"@type":"Article","@id":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#article","isPartOf":{"@id":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#webpage"},"author":{"@id":"https:\/\/btechgeeks.com\/#\/schema\/person\/ea8ce699662f0d7e248e52fe080b85bb"},"headline":"Python Interview Questions on Linked List","datePublished":"2024-03-31T10:25:15+00:00","dateModified":"2024-04-01T10:26:18+00:00","mainEntityOfPage":{"@id":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#webpage"},"wordCount":1800,"commentCount":0,"publisher":{"@id":"https:\/\/btechgeeks.com\/#organization"},"image":{"@id":"https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/btechgeeks.com\/wp-content\/uploads\/2021\/06\/Python-Interview-Questions-on-Linked-List-chapter-11-img-3.png","articleSection":["Python"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/btechgeeks.com\/python-interview-questions-on-linked-list\/#respond"]}]},{"@type":"Person","@id":"https:\/\/btechgeeks.com\/#\/schema\/person\/ea8ce699662f0d7e248e52fe080b85bb","name":"Prasanna","image":{"@type":"ImageObject","@id":"https:\/\/btechgeeks.com\/#personlogo","inLanguage":"en-US","url":"https:\/\/secure.gravatar.com\/avatar\/174540ad43736c7d1a4c4f83c775e74d?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/174540ad43736c7d1a4c4f83c775e74d?s=96&d=mm&r=g","caption":"Prasanna"},"url":"https:\/\/btechgeeks.com\/author\/prasanna\/"}]}},"jetpack_featured_media_url":"","jetpack-related-posts":[{"id":6533,"url":"https:\/\/btechgeeks.com\/remove-duplicate-elements-from-a-sorted-singly-linked-list\/","url_meta":{"origin":10173,"position":0},"title":"Remove Duplicate Elements from a Sorted Singly Linked List","date":"March 5, 2023","format":false,"excerpt":"Linked List: A linked list data structure is made up of a set of nodes that are linked together. Every node stores the data as well as the address of the next node. You have to start somewhere, so we give the first node's address a special name called HEAD.\u2026","rel":"","context":"In &quot;CPP Programming&quot;","img":{"alt_text":"Remove Duplicate Elements from a Sorted Singly Linked List","src":"https:\/\/i1.wp.com\/btechgeeks.com\/wp-content\/uploads\/2021\/05\/Remove-Duplicate-Elements-from-a-Sorted-Singly-Linked-List.png?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":33370,"url":"https:\/\/btechgeeks.com\/java-program-to-remove-nodes-from-the-beginning-and-end-of-a-linked-list\/","url_meta":{"origin":10173,"position":1},"title":"How to remove a node from a linked list java - Java Program to Remove Nodes from the Beginning and End of a Linked List","date":"September 28, 2022","format":false,"excerpt":"How to remove a node from a linked list java: In this article we are going to see how we can remove nodes from the beginning and end of a linked list by using Java programming language. Java Program to Remove Nodes from the Beginning and End of a Linked\u2026","rel":"","context":"In &quot;JAVA&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":33368,"url":"https:\/\/btechgeeks.com\/java-program-to-print-a-linked-list-in-reverse\/","url_meta":{"origin":10173,"position":2},"title":"Print a linked list java - Java Program to Print a Linked List in Reverse","date":"September 3, 2022","format":false,"excerpt":"Print a linked list java: In this article, we are going to see how we can print a linked list in reverse by using Java programming language. Java Program to Print a Linked List in Reverse As we know linked list is a type of liner data structure where the\u2026","rel":"","context":"In &quot;JAVA&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":33364,"url":"https:\/\/btechgeeks.com\/java-program-to-create-a-singly-linked-list-add-elements-to-it-and-display\/","url_meta":{"origin":10173,"position":3},"title":"Java Program to Create a Singly Linked List, Add Elements to it and Display","date":"March 15, 2024","format":false,"excerpt":"In this article, we are going to see how we can create a singly linked list, add elements to it and display it by using Java programming language. Java Program to Create a Singly Linked List, Add Elements to it and Display Singly LinkedList: In Java singly linkedlist is a\u2026","rel":"","context":"In &quot;JAVA&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":33376,"url":"https:\/\/btechgeeks.com\/java-program-to-search-for-an-element-in-a-singly-linked-list\/","url_meta":{"origin":10173,"position":4},"title":"Java Program to Search for an Element in a Singly Linked List","date":"March 31, 2024","format":false,"excerpt":"In this article we are going to see how we can search for an element in a singly linked list by using Java programming language. Java Program to Search for an Element in a Singly Linked List Approach: Create a linked list. Add elements to it. Display the list. Ask\u2026","rel":"","context":"In &quot;JAVA&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":9880,"url":"https:\/\/btechgeeks.com\/reverse-singly-linked-list\/","url_meta":{"origin":10173,"position":5},"title":"Reverse a singly linked list java - How To Reverse a Singly Linked List","date":"September 19, 2022","format":false,"excerpt":"Prerequisites How to reverse a singly linked list: To learn how to reverse singly linked lists, you should know: Python 3 Python data structures - List In place list reversal OOP concepts Part 1 \u00a0and Part 2 singly linked list What will we learn? Reverse singly linked list: In the\u2026","rel":"","context":"In &quot;Python&quot;","img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]}],"_links":{"self":[{"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/posts\/10173"}],"collection":[{"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/comments?post=10173"}],"version-history":[{"count":1,"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/posts\/10173\/revisions"}],"predecessor-version":[{"id":34934,"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/posts\/10173\/revisions\/34934"}],"wp:attachment":[{"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/media?parent=10173"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/categories?post=10173"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/btechgeeks.com\/wp-json\/wp\/v2\/tags?post=10173"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}