![\"Doubly](\"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Doubly-linked-list-normal-img08.jpg\")
<\/a><\/p>\nvoid DeleteAtPosition(int pos) \r\n{ \r\n struct node *ptr,*ptr1; \r\n ptr=head; \r\n for(i=0;i<pos;i++) \r\n { \r\n ptr1 = ptr; \r\n ptr = ptr->next; \r\n } \r\n ptr1 ->next = ptr -> next; \r\n ptr1 -> next -> previous = ptr1; \r\n free(ptr); \r\n}<\/pre>\nSearching node in Doubly Linked List<\/h3>\n
Traverse from either the head of the doubly linked list or from the tale of the doubly linked list and compare the search element to every node. If found, return true else return false.<\/span><\/p>\nBoolean flag= false;\r\nbool search(struct Node* head, int x)\r\n{\r\n struct Node* current = head;\r\n while (current != NULL)\r\n {\r\n if (current->key == x)\r\n {\r\n flag = true;\r\n break;\r\n }\r\n}\r\n return flag;\r\n}<\/pre>\nDisplay<\/h3>\n
Start Traversing from the head of the doubly linked list and keep on returning each node.<\/span><\/p>\nvoid display(struct Node* disp)\r\n{\r\n while (disp != NULL) \r\n{\r\n printf(\" %d \", disp -> data);\r\n disp = disp -> next;\r\n }\r\n}<\/pre>\nImplementation of doubly linked list in C<\/h3>\n#include <stdio.h>\r\n#include <stdlib.h>\r\n \r\nstruct Node\r\n {\r\n int data;\r\n struct Node* next;\r\n struct Node* previous;\r\n};\r\n \r\nint main()\r\n{\r\n struct Node* Node1 = NULL;\r\n struct Node* Node2 = NULL;\r\n struct Node* Node3 = NULL;\r\n \r\n \r\n Node1 = (struct Node*)malloc(sizeof(struct Node));\r\n Node2 = (struct Node*)malloc(sizeof(struct Node));\r\n Node3 = (struct Node*)malloc(sizeof(struct Node));\r\n \r\n \r\n Node1 -> data = 1; \r\n Node1 -> next = Node2; \r\n Node1 -> previous = NULL; \r\n \r\n Node2 -> data = 2;\r\n Node2 -> next = Node3;\r\n Node2 -> previous = Node1; \r\n \r\n Node3 -> data = 3; \r\n Node3 -> next = NULL;\r\n Node3 -> previous = Node2;\r\n\r\n display(Node1);\r\n return 0;\r\n}\r\n\r\nvoid display(struct Node* disp)\r\n{\r\n while (disp != NULL) \r\n{\r\n printf(\" %d \", disp -> data);\r\n disp = disp -> next;\r\n }\r\n}<\/pre>\nImplementation of doubly linked list in Python<\/h3>\nclass Node:\r\n def __init__(self, data):\r\n self.data = data \r\n self.next = None \r\n self.previous = None \r\n \r\nclass SinglyLinkedList: \r\n def __init__(self):\r\n self.head = None\r\n \r\n def DisplayList(self):\r\n temp = self.head\r\n while (temp):\r\n print (temp.data)\r\n temp = temp.next\r\n \r\nif __name__=='__main__':\r\n \r\n dll = SinglyLinkedList()\r\n \r\n dll.head = Node(\u201cDATA\u201d)\r\n Node2 = Node(\u201cFLAIR\u201d)\r\n Node3 = Node(\u201cDLL\u201d)\r\n \r\n dll.head.next = Node2; \r\n Node2.next = Node3; \r\n \r\n dll.head.previous = None;\r\n Node2.previous = dll.head;\r\n Node3.previous = Node2;\r\n \r\n dll.DisplayList()<\/pre>\nDoubly linked list implementation in C++<\/h3>\n#include <bits\/stdc++.h>\r\nusing namespace std;\r\n \r\nclass Node {\r\npublic:\r\n string data;\r\n Node* next;\r\n Node* previous;\r\n};\r\n \r\nvoid displayList(Node* n)\r\n{\r\n while (n != NULL)\r\n {\r\n cout << n -> data << \" \";\r\n n = n -> next;\r\n }\r\n}\r\n \r\nint main()\r\n{\r\n Node* Node1 = NULL;\r\n Node* Node2 = NULL;\r\n Node* Node3 = NULL;\r\n \r\n Node1 = new Node();\r\n Node2 = new Node();\r\n Node3 = new Node();\r\n \r\n Node1 -> data = \u201cDATA\u201d; \r\n Node1 -> next = Node2; \r\n Node1 -> previous = NULL;\r\n \r\n Node2 -> data = \u201cFLAIR\u201d; \r\n Node2 -> next = Node3;\r\n Node2 -> previous = Node1;\r\n \r\n Node3 -> data = \u201cDLL\u201d; \r\n Node3 -> next = NULL;\r\n Node3 -> previous = Node2;\r\n \r\n displayList(Node1);\r\n \r\n return 0;\r\n}<\/pre>\nImplementation of doubly linked list in Java<\/h3>\npublic class DoublyLinkedList {\r\n Node head; \r\n \r\n static class Node {\r\n String data;\r\n Node next;\r\n Node previous;\r\n \r\n Node(String str)\r\n {\r\n data = str;\r\n next = null;\r\n } \r\n }\r\n \r\n \r\n public void displayList()\r\n {\r\n Node n = head;\r\n while (n != null) \r\n {\r\n System.out.print(n.data + \" \");\r\n n = n.next;\r\n }\r\n }\r\n \r\n public static void main(String[] args)\r\n {\r\n \r\n DoublyLinkedList dllist = new DoublyLinkedList();\r\n \r\n Node Node1 = new Node(\"DATA\"); \r\n Node Node2 = new Node(\"FLAIR\");\r\n Node Node3 = new Node(\"DLL\");\r\n \r\n dllist.head = Node1;\r\n \r\n dllist.head.next = Node2; \r\n Node2.next = Node3; \r\n \r\n Node2.previous = Node1;\r\n Node3.previous = Node2;\r\n \r\n dllist.displayList();\r\n }\r\n}<\/pre>\nAdvantages of Doubly linked list<\/h3>\n\n- Both forward and backward traversing is possible.<\/span><\/li>\n
- Insert and Delete operations are highly efficient as compared to the singly linked list.<\/span><\/li>\n<\/ul>\n
Disadvantages of Doubly linked list<\/h3>\n\n- Every node requires large memory blocks since it has a previous pointer too. This makes it a little memory inefficient.\u00a0<\/span><\/li>\n<\/ul>\n
Singly-linked list Vs Doubly linked list<\/h3>\n
\n\n\n| Singly-linked list<\/b><\/td>\n | Doubly linked list<\/b><\/td>\n<\/tr>\n\n| Only one-way traversing is possible.<\/span><\/td>\n | Traversing is possible both ways.<\/span><\/td>\n<\/tr>\n\n| Requires only one pointer per node leading to less memory utilization.<\/span><\/td>\n | Requires two pointers per node leading to more memory utilization.<\/span><\/td>\n<\/tr>\n\n| The worst-case time complexity for inserting or deleting a node is O(n)which makes it less efficient.<\/span><\/td>\n | The worst-case time complexity for inserting or deleting a node is O(1), which makes it more efficient than a singly linked list.<\/span><\/td>\n<\/tr>\n\n| It is implemented on stacks.<\/span><\/td>\n | It is implemented on stacks, heap, and binary trees.<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\nConclusion<\/h3>\nA doubly linked list is a more efficient version of a singly linked list. Although it requires more memory, Insert and delete operations are carried out in constant time complexity. <\/span><\/p>\nHere we also learned the step-by-step procedure for insertion and deletion of nodes at different positions in an already existing doubly linked list.\u00a0<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"We have already seen the singly linked list in our previous article. A doubly linked list is a complex version of a singly linked list. Unlike a singly linked list, a doubly-linked list has...<\/p>\n","protected":false},"author":1,"featured_media":95024,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[24020],"tags":[24339,4038,24338,24341,24340],"class_list":["post-94981","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-data-structure-tutorials","tag-applications-of-doubly-linked-list","tag-doubly-linked-list","tag-doubly-linked-list-in-data-structure","tag-operations-on-doubly-linked-list","tag-single-linked-list-vs-doubly-linked-list"],"yoast_head":"\n Doubly Linked List in Data Structure - DataFlair<\/title>\n<meta name=\"description\" content=\"Doubly linked list is a type of linked list in which a node contains pointer to previous as well as next node in the sequence. Learn more.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Doubly Linked List in Data Structure - DataFlair\" \/>\n<meta property=\"og:description\" content=\"Doubly linked list is a type of linked list in which a node contains pointer to previous as well as next node in the sequence. Learn more.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/\" \/>\n<meta property=\"og:site_name\" content=\"DataFlair\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/DataFlairWS\/\" \/>\n<meta property=\"article:published_time\" content=\"2021-05-24T03:30:04+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Doubly-linked-list-in-DS.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1200\" \/>\n\t<meta property=\"og:image:height\" content=\"628\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"author\" content=\"DataFlair Team\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:site\" content=\"@DataFlairWS\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"DataFlair Team\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"9 minutes\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Doubly Linked List in Data Structure - DataFlair","description":"Doubly linked list is a type of linked list in which a node contains pointer to previous as well as next node in the sequence. Learn more.","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:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/","og_locale":"en_US","og_type":"article","og_title":"Doubly Linked List in Data Structure - DataFlair","og_description":"Doubly linked list is a type of linked list in which a node contains pointer to previous as well as next node in the sequence. Learn more.","og_url":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/","og_site_name":"DataFlair","article_publisher":"https:\/\/www.facebook.com\/DataFlairWS\/","article_published_time":"2021-05-24T03:30:04+00:00","og_image":[{"width":1200,"height":628,"url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Doubly-linked-list-in-DS.jpg","type":"image\/jpeg"}],"author":"DataFlair Team","twitter_card":"summary_large_image","twitter_creator":"@DataFlairWS","twitter_site":"@DataFlairWS","twitter_misc":{"Written by":"DataFlair Team","Est. reading time":"9 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/#article","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/"},"author":{"name":"DataFlair Team","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/b49855299264df5e27e3ec6c2cd9fde9"},"headline":"Doubly Linked List in Data Structure","datePublished":"2021-05-24T03:30:04+00:00","mainEntityOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/"},"wordCount":884,"commentCount":0,"publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/#primaryimage"},"thumbnailUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Doubly-linked-list-in-DS.jpg","keywords":["Applications of Doubly linked list","Doubly linked list","Doubly linked list in data structure","Operations on Doubly Linked list","Single Linked List vs Doubly linked list"],"articleSection":["Data Structure Tutorials"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/","url":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/","name":"Doubly Linked List in Data Structure - DataFlair","isPartOf":{"@id":"https:\/\/data-flair.training\/blogs\/#website"},"primaryImageOfPage":{"@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/#primaryimage"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/#primaryimage"},"thumbnailUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Doubly-linked-list-in-DS.jpg","datePublished":"2021-05-24T03:30:04+00:00","description":"Doubly linked list is a type of linked list in which a node contains pointer to previous as well as next node in the sequence. Learn more.","breadcrumb":{"@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/#primaryimage","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Doubly-linked-list-in-DS.jpg","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Doubly-linked-list-in-DS.jpg","width":1200,"height":628,"caption":"Doubly linked list in Data Structure"},{"@type":"BreadcrumbList","@id":"https:\/\/data-flair.training\/blogs\/doubly-linked-list-in-data-structure\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog Home","item":"https:\/\/data-flair.training\/blogs\/"},{"@type":"ListItem","position":2,"name":"Data Structure Tutorials","item":"https:\/\/data-flair.training\/blogs\/category\/data-structure-tutorials\/"},{"@type":"ListItem","position":3,"name":"Doubly Linked List in Data Structure"}]},{"@type":"WebSite","@id":"https:\/\/data-flair.training\/blogs\/#website","url":"https:\/\/data-flair.training\/blogs\/","name":"DataFlair","description":"Learn Today. Lead Tomorrow.","publisher":{"@id":"https:\/\/data-flair.training\/blogs\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/data-flair.training\/blogs\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/data-flair.training\/blogs\/#organization","name":"DataFlair","url":"https:\/\/data-flair.training\/blogs\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/","url":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","contentUrl":"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2016\/07\/Data-Flair.png","width":106,"height":48,"caption":"DataFlair"},"image":{"@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/DataFlairWS\/","https:\/\/x.com\/DataFlairWS","https:\/\/www.linkedin.com\/company\/dataflair-web-services-pvt-ltd\/","https:\/\/www.youtube.com\/user\/DataFlairWS"]},{"@type":"Person","@id":"https:\/\/data-flair.training\/blogs\/#\/schema\/person\/b49855299264df5e27e3ec6c2cd9fde9","name":"DataFlair Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/ef46b745ddad2fad690af626c6ef29b91809ad0a9f5ef398d07817d8cad042f5?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/ef46b745ddad2fad690af626c6ef29b91809ad0a9f5ef398d07817d8cad042f5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/ef46b745ddad2fad690af626c6ef29b91809ad0a9f5ef398d07817d8cad042f5?s=96&d=mm&r=g","caption":"DataFlair Team"},"description":"DataFlair Team is a group of passionate educators and industry experts dedicated to providing high-quality online learning resources on programming, Java, Python, C++, DSA, AI, ML, data Science, Android, Flutter, MERN, Web Development, and technology. With years of experience in the field, the team aims to simplify complex topics and help learners advance their careers. At DataFlair, we believe in empowering students and professionals with the knowledge and skills needed to thrive in today\u2019s fast-paced tech industry. Follow us for Free courses, expert insights, tutorials, and practical tips to boost your learning journey.","url":"https:\/\/data-flair.training\/blogs\/author\/datafbdad\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/94981","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/comments?post=94981"}],"version-history":[{"count":4,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/94981\/revisions"}],"predecessor-version":[{"id":95318,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/posts\/94981\/revisions\/95318"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media\/95024"}],"wp:attachment":[{"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/media?parent=94981"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/categories?post=94981"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/data-flair.training\/blogs\/wp-json\/wp\/v2\/tags?post=94981"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}} | | | | |
![\"Doubly](\"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Doubly-linked-list-normal-img01.jpg\")
<\/a><\/p>\n![\"Adding](\"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2021\/05\/Doubly-linked-list-normal-img02.jpg\")
<\/a><\/p>\n