﻿ C++ - Create and display a doubly linked list

# C++ Linked List Exercises: Create and display a doubly linked list

## C++ Linked List: Exercise-15 with Solution

Write a C++ program to create and display a doubly linked list.

Test Data:
Doubly linked list is as follows:
Traversal in Forward direction:
Orange White Green Red
Traversal in Reverse direction:
Red Green White Orange

Sample Solution:

C++ Code:

``````#include <iostream>

using namespace std;

// A doubly linked list node
struct Node {
string data;
struct Node* next;
struct Node* prev;
};

//Append node at the front of the list
{
//Create a new node and allocate memory.
struct Node* newNode = new Node;

//assign data to new node
newNode->data = new_data;

// A new node has been added with the name head and the previous node
// set to null, since it is being added at the front.
newNode->prev = NULL;

}

// Following function display contents of the doubly linked list
{
Node* last_node;
cout << "\n\nTraversal in Forward direction:\n";
cout << " " << head->data << " ";
}
cout << "\n\nTraversal in Reverse direction:\n";
while (last_node != NULL) {
cout << " " << last_node->data << " ";
last_node = last_node->prev;
}
}

//main program
int main() {
cout<<"Doubly linked list is as follows: ";
return 0;
}
``````

Sample Output:

```Doubly linked list is as follows:

Traversal in Forward direction:
Orange  White  Green  Red

Traversal in Reverse direction:
Red  Green  White  Orange
```

Flowchart:

CPP Code Editor:

Previous C++ Exercise: Kth node from the Middle towards Head of a Linked List.
Next C++ Exercise: Reverse doubly linked list.

What is the difficulty level of this exercise?

﻿

## C++ Programming: Tips of the Day

How to replace all occurrences of a character in string?

std::string doesn't contain such function but you could use stand-alone replace function from algorithm header.

```#include <algorithm>
#include <string>

void some_func() {
std::string s = "example string";
std::replace( s.begin(), s.end(), 'x', 'y'); // replace all 'x' to 'y'
}
```

Ref: https://bit.ly/3niU71x