![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663789612205-Topic%20Delete.jpg\")
<\/p>\n<\/p>\n
In this article, we will discuss the deletion in a doubly linked list in c. If you would like to ace the data structures and algorithms easily, then you are at the right place! Deletion and Insertion<\/a> are the two important functions in the implementation of a doubly linked list in C.<\/p>\n Doubly linked is basically a kind of linked list that can be traversed in both directions easily as there is one more pointer that holds the address of the previous node of the linked list. The insertion and deletion process in a doubly linked list is easier as compared to a singly linked list. Even if we know the place where we have to insert or delete then that process can be done in O(1) time complexity.<\/p>\n Let\u2019s Discuss deletion in a doubly linked list in c.<\/p>\n Test your data structure skills by taking this Data Structure and Algorithm Mock Test<\/a> designed by experienced mentors at PrepBytes<\/a>.<\/p>\n Similar to insertion, deletion can be done from the three positions in the doubly linked list.<\/p>\n 1. Delete from the front end<\/strong> Finally, free the memory of del_node. And, the linked list will look like this<\/p>\n Here is the implementation of deleting a node from the front end of the doubly linked list:Definition Of Doubly Linked List<\/h3>\n
![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663789836593-37_Artboard%203.png\")
<\/p>\nDeletion in DLL:<\/h3>\n
\n
\nIf the node to be deleted (i.e. del_node) is at the beginning
\nChange the head to the next of the del_node <\/p>\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663789880718-37_Artboard%2014.png\")
<\/p>\n![\"\"](\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1663790069976-37_Artboard%2015.png\")
<\/p>\n
\n\t\t\t\t\t\t