{"id":28788,"date":"2021-02-26T16:10:51","date_gmt":"2021-02-26T16:10:51","guid":{"rendered":"https:\/\/www.techolac.com\/?p=28788"},"modified":"2021-02-26T16:10:51","modified_gmt":"2021-02-26T16:10:51","slug":"understand-doubly-linked-list-c-with-illustration","status":"publish","type":"post","link":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/","title":{"rendered":"Understand Doubly Linked List C++ With Illustration"},"content":{"rendered":"

This post will explain doubly linked list c++. A twice as connected list is a variation of the singly linked list. We understand that the singly linked list is a collection of nodes, with each node having a data part and a pointer indicating the next node.<\/p>\n

A doubly connected list is also a collection of nodes. Each node here includes an information part and two pointers. One tip points to the previous node, while the second pointer indicates the next node.<\/p>\n

Understand Doubly Linked List C++ With Illustration<\/h2>\n

In this article, you can know about doubly linked list c++ here are the details below;<\/p>\n

Doubly Linked In C++<\/h2>\n

As in the singly connected list, the two times as connected list also has a head and a tail. The previous guideline of the head is set to NULL as this is the very first node. The next pointers of the tail node is set to NULL as this is the last node.
\nA basic layout of the two times as connected list is displayed in the below diagram.<\/p>\n

In the above figures, we see that each node has two pointers, pointing to the previous node and the other indicating the next node. Only the primary node (head) has its previous nodes set to null, and the last node (tail) has its next pointers set to null. You can also check best ihome speakers<\/a>.<\/p>\n

As the doubly connected list contains two pointers, i.e., previous and next, we can traverse it into the instructions forward and backward. This is the primary benefit of two times as a linked list over the singly connected list.<\/p>\n

Declaration<\/h2>\n

In C-style declaration, a nodes of the doubly linked list is represented as follows:
\nstruct node
\n;
\nApart from the above declaration, we can likewise represent a node in the doubly linked list as a classes in C++. A doubly connected list is represented as a class when we utilize STL in C++. We can execute a twice as linked list using a class in Java too.<\/p>\n

Basic Operations<\/h2>\n

Following are some of the operation’s that we can perform two times as a connected list.
\nInsertion
\nInsertion operation of the twice as connected list inserts a brand-new node in the linked list. Depending opon the position where the new node is to be placed, we can have the following<\/p>\n

insert operations.<\/h2>\n

– Insertion at the front– Inserts a brand-new node as the first node.
\n– Insertion at the end– Inserts a brand-new node at the end as the last node.
\n– Insertion before a node– Given a node, inserts a new node before this node.
\n– Insertion after a node– Given a node, inserts a new node after this node.<\/p>\n

Deletion<\/h2>\n

Deletion operation deletes a node from a provided position in the twice as connected list
\n– Deletion of the first node– Deletes the very first node in the list.
\n– Deletion of the last node– Deletes the last node in the list.
\nDeleting a node given the information: Given the information, the operation matches the data with the node information in the linked list and deletes that node.<\/p>\n

Traversal<\/h2>\n

Traversal is a strategy of going to each node in the connected list. In a twice as connected list, we have two kinds of traversals as we have two guidelines with various instructions in the two times as linked list.
\n– Forward Traversal– Traversal is done using the next tip, which is in the forward instructions.
\n– Backward Traversal– Traversal is done utilizing the previous guideline, which is the backward direction.<\/p>\n

Reverse<\/h2>\n

This operation reverses the nodes in the two times as linked list so that the first node becomes the last nodes while the last node becomes the first node.<\/p>\n

Search<\/h2>\n

Search operation in the doubly connected list is used to look for a specific node in the linked list. For this purpose, we require to traverse the list until matching information is found.<\/p>\n

Insertion<\/h2>\n

Insert a node at the front<\/p>\n

The insertion of a new nodes at the front of the list is shown above. As seen, the previous brand-new node N is set to null. Head points to the new node. The next tip now indicates N1, and the previous of N1 that was earlier pointing to Null now indicates N.
\nInsert node at the end<\/p>\n

Inserting a nodes at the end of the two times as linked list is attained by pointing the next node N to null. The premature pointer of N is pointed to N5. The ‘Next’ tip of N5 is pointed to N.<\/p>\n

Insert node before\/after given node<\/h2>\n

As shown in the aboves diagram, when we need to include a node before or after a particular node, we alter the previous and next guidelines of the before and after nodes to properly indicate the new node. Likewise, the brand-new node guidelines are appropriately pointed to the existing nodes. Also check textsheet alternatives<\/a>.<\/p>\n

The following C++ program shows all the above methods to insert nodes in the twice as linked list.<\/h2>\n
\n
\n\n\n\n
\n
\n
#include <iostream><\/code><\/div>\n
using<\/code> namespace<\/code> std;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/ A doubly linked list node<\/code><\/div>\n
struct<\/code> Node {<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>int<\/code> data;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>struct<\/code> Node* next;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>struct<\/code> Node* prev;<\/code><\/div>\n
};<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/inserts node at the front of the list<\/code><\/div>\n
void<\/code> insert_front(<\/code>struct<\/code> Node** head, <\/code>int<\/code> new_data)<\/code><\/div>\n
{<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/allocate memory for New node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>struct<\/code> Node* newNode = <\/code>new<\/code> Node;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/assign data to new node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->data = new_data;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/new node is head and previous is null, since we are adding at the front<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->next = (*head);<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->prev = NULL;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/previous of head is new node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code> ((*head) != NULL)<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>(*head)->prev = newNode;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/head points to new node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>(*head) = newNode;<\/code><\/div>\n
}<\/code><\/div>\n
\/* Given a node as prev_node, insert a new node after the given node *\/<\/code><\/div>\n
void<\/code> insert_After(<\/code>struct<\/code> Node* prev_node, <\/code>int<\/code> new_data)<\/code><\/div>\n
{<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/check if prev node is null<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code> (prev_node == NULL) {<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>cout<<<\/code>\"Previous node is required , it cannot be NULL\"<\/code>;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>return<\/code>;<\/code><\/div>\n
}<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/allocate memory for new node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>struct<\/code> Node* newNode = <\/code>new<\/code> Node;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/assign data to new node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->data = new_data;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set next of newnode to next of prev node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->next = prev_node->next;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set next of prev node to newnode<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>prev_node->next = newNode;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/now set prev of newnode to prev node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->prev = prev_node;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set prev of new node's next to newnode<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code> (newNode->next != NULL)<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->next->prev = newNode;<\/code><\/div>\n
}<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/insert a new node at the end of the list<\/code><\/div>\n
void<\/code> insert_end(<\/code>struct<\/code> Node** head, <\/code>int<\/code> new_data)<\/code><\/div>\n
{<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/allocate memory for node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>struct<\/code> Node* newNode = <\/code>new<\/code> Node;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>struct<\/code> Node* last = *head; <\/code>\/\/set last node value to head<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set data for new node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->data = new_data;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/new node is the last node , so set next of new node to null<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->next = NULL;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/check if list is empty, if yes make new node the head of list<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code> (*head == NULL) {<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode->prev = NULL;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>*head = newNode;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>return<\/code>;<\/code><\/div>\n
}<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/otherwise traverse the list to go to last node<\/code><\/div>\n
while<\/code> (last->next != NULL)<\/code><\/div>\n
last = last->next;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/set next of last to new node<\/code><\/div>\n
last->next = newNode;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/set last to prev of new node<\/code><\/div>\n
newNode->prev = last;<\/code><\/div>\n
return<\/code>;<\/code><\/div>\n
}<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/ This function prints contents of linked list starting from the given node<\/code><\/div>\n
void<\/code> displayList(<\/code>struct<\/code> Node* node) {<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>struct<\/code> Node* last;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>while<\/code> (node != NULL) {<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>cout<<node->data<<<\/code>\"<==>\"<\/code>;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>last = node;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>node = node->next;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code>(node == NULL)<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>cout<<<\/code>\"NULL\"<\/code>;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/main program<\/code><\/div>\n
int<\/code> main() {<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/* Start with the empty list *\/<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>struct<\/code> Node* head = NULL;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/ Insert 40 as last node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>insert_end(&head, 40);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/ insert 20 at the head<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>insert_front(&head, 20);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/ Insert 10 at the beginning.<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>insert_front(&head, 10);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/ Insert 50 at the end.<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>insert_end(&head, 50);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/ Insert 30, after 20.<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>insert_After(head->next, 30);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>cout<<<\/code>\"Doubly linked list is as follows: \"<\/code><<endl;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>displayList(head);<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>return<\/code> 0;<\/code><\/div>\n
}<\/code><\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n

A node can be erased from a twice as connected list from any position like the front, end, or any other offered position or offered information.
\nWhen deleting a node from the doubly connected list, we first reposition the pointer indicating that particular node. The previous and after nodes don’t have any connection to the node to be deleted. We can then quickly erase the node.<\/p>\n

Consider the following two times as a connected list with three nodes A, B, C. Let us consider that we require to erase node B.<\/p>\n

As displayed in the diagram above, we have demonstrated the deletion of node B from the provided connected list. The series of operations remains the same even if the node is 1st or last. The only care that should be considered is that if the first node is erased, the second node’s previous pointer will be null.<\/p>\n

Likewise, when the last node is deleted, the previous node’s next pointer will be set to null. If in-between nodes are deleted, then the sequence will be as above.
\nWe leave the programs to delete a node from two times as a linked list. Note thats the implementation will be on the line’s of the insertion implementation. Also check wow private servers<\/a>.<\/p>\n

Reverse Doubly Linked List.<\/h2>\n

Reversing two times as a linked list is a crucial operation. In this, we just swap the previous and next tips of all the nodes and likewise switch the head and tail guidelines.
\nProvided listed below is a doubly connected list:<\/p>\n

\n
\n\n\n\n
\n
\n
\/\/ Java Class for Doubly Linked List<\/code><\/div>\n
class<\/code> Doubly_linkedList {<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>Node head; <\/code>\/\/ list head<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0<\/code>\/* Doubly Linked list Node*\/<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>class<\/code> Node {<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>int<\/code> data;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>Node prev;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>Node next;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>\/\/create a new node using constructor<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>Node(<\/code>int<\/code> d) { data = d; }<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/ insert a node at the front of the list<\/code><\/div>\n
public<\/code> void<\/code> insert_front(<\/code>int<\/code> new_data)<\/code><\/div>\n
{<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/* 1. allocate node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>* 2. put in the data *\/<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>Node new_Node = <\/code>new<\/code> Node(new_data);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/* 3. Make next of new node as head and previous as NULL *\/<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>new_Node.next = head;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>new_Node.prev = null;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/* 4. change prev of head node to new node *\/<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code> (head != null)<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>head.prev = new_Node;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/* 5. move the head to point to the new node *\/<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>head = new_Node;<\/code><\/div>\n
}<\/code><\/div>\n
\/\/insert a node after the given prev node<\/code><\/div>\n
public<\/code> void<\/code> Insert_After(Node prev_Node, <\/code>int<\/code> new_data)<\/code><\/div>\n
{<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/check that prev node is not null<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code> (prev_Node == null) {<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>System.out.println(<\/code>\"The previous node is required,it cannot be NULL \"<\/code>);<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>return<\/code>;<\/code><\/div>\n
}<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/allocate new node and set it to data<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>Node newNode = <\/code>new<\/code> Node(new_data);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set next of newNode as next of prev node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode.next = prev_Node.next;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set new node to next of prev node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>prev_Node.next = newNode;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set prev of newNode as prev node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode.prev = prev_Node;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set prev of new node's next to newnode<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code> (newNode.next != null)<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode.next.prev = newNode;<\/code><\/div>\n
}<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\/\/ Add a node at the end of the list<\/code><\/div>\n
void<\/code> insert_end(<\/code>int<\/code> new_data)\u00a0\u00a0 {<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/allocate the node and set the data<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>Node newNode = <\/code>new<\/code> Node(new_data);<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>Node last = head; <\/code>\/\/set last as the head<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set next of new node to null since its the last node<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode.next = null;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/set new node as head if the list is null<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code> (head == null) {<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>newNode.prev = null;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>head = newNode;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>return<\/code>;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>\/\/if list is not null then traverse it till the last node and set last next to last<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>while<\/code> (last.next != null)<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>last = last.next;<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>last.next = newNode; \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 <\/code>\/\/set last next to new node<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>newNode.prev = last; \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0<\/code>\/\/set last as prev of new node<\/code><\/div>\n
}<\/code><\/div>\n
\/\/ display the contents of linked list starting from the given node<\/code><\/div>\n
public<\/code> void<\/code> displaylist(Node node)<\/code><\/div>\n
{<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>Node last = null;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>while<\/code> (node != null) {<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>System.out.print(node.data + <\/code>\"<==>\"<\/code>);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>last = node;<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>node = node.next;<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>if<\/code>(node == null)<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>System.out.print(<\/code>\"null\"<\/code>);<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>System.out.println();<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
}<\/code><\/div>\n
class<\/code> Main{<\/code><\/div>\n
\u00a0\u00a0\u00a0<\/code>public<\/code> static<\/code> void<\/code> main(String[] args)<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>{<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>\/* Start with the empty list *\/<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>Doubly_linkedList dll = <\/code>new<\/code> Doubly_linkedList();<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>\/\/ Insert 40.<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>dll.insert_end(40);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>\/\/ Insert 20 at the beginning.<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>dll.insert_front(20);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>\/\/ Insert 10 at the beginning.<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>dll.insert_front(10);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>\/\/ Insert 50 at the end.<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>dll.insert_end(50);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>\/\/ Insert 30, after 20.<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>dll.Insert_After(dll.head.next, 30);<\/code><\/div>\n
\u00a0<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>System.out.println(<\/code>\"Doubly linked list created is as follows: \"<\/code>);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>dll.displaylist(dll.head);<\/code><\/div>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<\/code>}<\/code><\/div>\n
}<\/code><\/div>\n<\/div>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n<\/div>\n

Benefits:<\/h2>\n

– The doubly linked list can be traverseds in forward and backward directions, unlike singly connected list which can be passed through in the forward direction just.
\n– Delete operation in a doubly-linked lists is more efficient when compared to a singly note when a provided node is given. As we require a previous node to erase the provided node in a singly linked list, we often need to traverse the list to discover the previous node. This hits the performance.
\n– Insertion operation can be done quickly in two times as linked to the singly connected list.<\/p>\n","protected":false},"excerpt":{"rendered":"

This post will explain doubly linked list c++. A twice as connected list is a variation of the singly linked list. We understand that the singly linked list is a collection of nodes, with each node having a data part and a pointer indicating the next node. A doubly connected list is also a collection […]<\/p>\n","protected":false},"author":3,"featured_media":28789,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[24,26],"tags":[3873],"class_list":["post-28788","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-internet","category-linux","tag-doubly-linked-list-c"],"yoast_head":"\nUnderstand Doubly Linked List C++ With Illustration - Techolac<\/title>\n<meta name=\"description\" content=\"Understand Doubly Linked List C++ With Illustration. This post will explain doubly linked list c++. A twice as connected list is a variation\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Understand Doubly Linked List C++ With Illustration - Techolac\" \/>\n<meta property=\"og:description\" content=\"Understand Doubly Linked List C++ With Illustration. This post will explain doubly linked list c++. A twice as connected list is a variation\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/\" \/>\n<meta property=\"og:site_name\" content=\"Techolac - Computer Technology News\" \/>\n<meta property=\"article:published_time\" content=\"2021-02-26T16:10:51+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1039\" \/>\n\t<meta property=\"og:image:height\" content=\"583\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"Luke\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Luke\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"10 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/\"},\"author\":{\"name\":\"Luke\",\"@id\":\"https:\/\/www.techolac.com\/#\/schema\/person\/c10974df2877dee6ed1da15511093444\"},\"headline\":\"Understand Doubly Linked List C++ With Illustration\",\"datePublished\":\"2021-02-26T16:10:51+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/\"},\"wordCount\":1207,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/www.techolac.com\/#\/schema\/person\/3c09b621dfc5ef8f09b6f48236a9ae7b\"},\"image\":{\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png\",\"keywords\":[\"doubly linked list c++\"],\"articleSection\":[\"Internet\",\"Linux\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/\",\"url\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/\",\"name\":\"Understand Doubly Linked List C++ With Illustration - Techolac\",\"isPartOf\":{\"@id\":\"https:\/\/www.techolac.com\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png\",\"datePublished\":\"2021-02-26T16:10:51+00:00\",\"description\":\"Understand Doubly Linked List C++ With Illustration. This post will explain doubly linked list c++. A twice as connected list is a variation\",\"breadcrumb\":{\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#primaryimage\",\"url\":\"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png\",\"contentUrl\":\"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png\",\"width\":1039,\"height\":583,\"caption\":\"doubly linked list c++\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/www.techolac.com\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Understand Doubly Linked List C++ With Illustration\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.techolac.com\/#website\",\"url\":\"https:\/\/www.techolac.com\/\",\"name\":\"Techolac - Computer Technology News\",\"description\":\"A weblog on emerging technology and internet news, reviews, tips for a broad range of computing technologies.\",\"publisher\":{\"@id\":\"https:\/\/www.techolac.com\/#\/schema\/person\/3c09b621dfc5ef8f09b6f48236a9ae7b\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.techolac.com\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/www.techolac.com\/#\/schema\/person\/3c09b621dfc5ef8f09b6f48236a9ae7b\",\"name\":\"Editorial Staff\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.techolac.com\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/46bb6cbf5ea4efe79156ff0f5de0a9602d1d0e5da0cb54b21e05a35d7e23379c?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/46bb6cbf5ea4efe79156ff0f5de0a9602d1d0e5da0cb54b21e05a35d7e23379c?s=96&d=mm&r=g\",\"caption\":\"Editorial Staff\"},\"logo\":{\"@id\":\"https:\/\/www.techolac.com\/#\/schema\/person\/image\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.techolac.com\/#\/schema\/person\/c10974df2877dee6ed1da15511093444\",\"name\":\"Luke\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/www.techolac.com\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/60a61099026e572b4ef7ca8eb0423230ce1840478525b72d1598d793882c7ce7?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/60a61099026e572b4ef7ca8eb0423230ce1840478525b72d1598d793882c7ce7?s=96&d=mm&r=g\",\"caption\":\"Luke\"},\"url\":\"https:\/\/www.techolac.com\/author\/luke\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Understand Doubly Linked List C++ With Illustration - Techolac","description":"Understand Doubly Linked List C++ With Illustration. This post will explain doubly linked list c++. A twice as connected list is a variation","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:\/\/www.techolac.com\/doubly-linked-list-c-\/","og_locale":"en_US","og_type":"article","og_title":"Understand Doubly Linked List C++ With Illustration - Techolac","og_description":"Understand Doubly Linked List C++ With Illustration. This post will explain doubly linked list c++. A twice as connected list is a variation","og_url":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/","og_site_name":"Techolac - Computer Technology News","article_published_time":"2021-02-26T16:10:51+00:00","og_image":[{"width":1039,"height":583,"url":"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png","type":"image\/png"}],"author":"Luke","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Luke","Est. reading time":"10 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#article","isPartOf":{"@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/"},"author":{"name":"Luke","@id":"https:\/\/www.techolac.com\/#\/schema\/person\/c10974df2877dee6ed1da15511093444"},"headline":"Understand Doubly Linked List C++ With Illustration","datePublished":"2021-02-26T16:10:51+00:00","mainEntityOfPage":{"@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/"},"wordCount":1207,"commentCount":0,"publisher":{"@id":"https:\/\/www.techolac.com\/#\/schema\/person\/3c09b621dfc5ef8f09b6f48236a9ae7b"},"image":{"@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#primaryimage"},"thumbnailUrl":"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png","keywords":["doubly linked list c++"],"articleSection":["Internet","Linux"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.techolac.com\/doubly-linked-list-c-\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/","url":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/","name":"Understand Doubly Linked List C++ With Illustration - Techolac","isPartOf":{"@id":"https:\/\/www.techolac.com\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#primaryimage"},"image":{"@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#primaryimage"},"thumbnailUrl":"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png","datePublished":"2021-02-26T16:10:51+00:00","description":"Understand Doubly Linked List C++ With Illustration. This post will explain doubly linked list c++. A twice as connected list is a variation","breadcrumb":{"@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.techolac.com\/doubly-linked-list-c-\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#primaryimage","url":"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png","contentUrl":"https:\/\/www.techolac.com\/wp-content\/uploads\/2021\/02\/Screenshot-2020-10-09-at-5.15.30-PM.png","width":1039,"height":583,"caption":"doubly linked list c++"},{"@type":"BreadcrumbList","@id":"https:\/\/www.techolac.com\/doubly-linked-list-c-\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.techolac.com\/"},{"@type":"ListItem","position":2,"name":"Understand Doubly Linked List C++ With Illustration"}]},{"@type":"WebSite","@id":"https:\/\/www.techolac.com\/#website","url":"https:\/\/www.techolac.com\/","name":"Techolac - Computer Technology News","description":"A weblog on emerging technology and internet news, reviews, tips for a broad range of computing technologies.","publisher":{"@id":"https:\/\/www.techolac.com\/#\/schema\/person\/3c09b621dfc5ef8f09b6f48236a9ae7b"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.techolac.com\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":["Person","Organization"],"@id":"https:\/\/www.techolac.com\/#\/schema\/person\/3c09b621dfc5ef8f09b6f48236a9ae7b","name":"Editorial Staff","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.techolac.com\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/46bb6cbf5ea4efe79156ff0f5de0a9602d1d0e5da0cb54b21e05a35d7e23379c?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/46bb6cbf5ea4efe79156ff0f5de0a9602d1d0e5da0cb54b21e05a35d7e23379c?s=96&d=mm&r=g","caption":"Editorial Staff"},"logo":{"@id":"https:\/\/www.techolac.com\/#\/schema\/person\/image\/"}},{"@type":"Person","@id":"https:\/\/www.techolac.com\/#\/schema\/person\/c10974df2877dee6ed1da15511093444","name":"Luke","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.techolac.com\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/60a61099026e572b4ef7ca8eb0423230ce1840478525b72d1598d793882c7ce7?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/60a61099026e572b4ef7ca8eb0423230ce1840478525b72d1598d793882c7ce7?s=96&d=mm&r=g","caption":"Luke"},"url":"https:\/\/www.techolac.com\/author\/luke\/"}]}},"amp_enabled":true,"_links":{"self":[{"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/posts\/28788","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/comments?post=28788"}],"version-history":[{"count":3,"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/posts\/28788\/revisions"}],"predecessor-version":[{"id":28792,"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/posts\/28788\/revisions\/28792"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/media\/28789"}],"wp:attachment":[{"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/media?parent=28788"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/categories?post=28788"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.techolac.com\/wp-json\/wp\/v2\/tags?post=28788"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}