Please convert the provided code below into C++ language because it's currently in C. thanks! Code: #include #include typedef struct se_list_type { int num; struct se_list_type* prev; struct se_list_type* next; } se_list; int main() { // Start the list se_list* head = NULL; se_list* cur = NULL; // Create the first node head = (se_list*)malloc(sizeof(se_list)); head->num = 2; head->prev = NULL; head->next = NULL; cur = head; // Create the second node cur->next = (se_list*)malloc(sizeof(se_list)); cur->next->prev = cur; cur = cur->next; cur->num = 1; cur->prev = head; cur->next = NULL; // Create the third node cur->next = (se_list*)malloc(sizeof(se_list)); cur->next->prev = cur; cur = cur->next; cur->num = -5; cur->prev = head->next; cur->next = NULL; // Create 10 more random nodes srand(0); for (int i = 0; i < 10; i++) { cur->next = (se_list*)malloc(sizeof(se_list)); cur->next->prev = cur; cur = cur->next; cur->num = rand() % 20 - 10; cur->prev = cur->next; cur->next = NULL; } // Print the list forward cur = head; while (cur != NULL) { printf("%d ", cur->num); cur = cur->next; } printf("\n"); // Free the memory cur = head; while (cur != NULL) { se_list* next = cur->next; free(cur); cur = next; } return 0; }
answer asap
Please convert the provided code below into C++ language because it's currently in C. thanks!
Code:
#include <stdio.h>
#include <stdlib.h>
typedef struct se_list_type {
int num;
struct se_list_type* prev;
struct se_list_type* next;
} se_list;
int main() {
// Start the list
se_list* head = NULL;
se_list* cur = NULL;
// Create the first node
head = (se_list*)malloc(sizeof(se_list));
head->num = 2;
head->prev = NULL;
head->next = NULL;
cur = head;
// Create the second node
cur->next = (se_list*)malloc(sizeof(se_list));
cur->next->prev = cur;
cur = cur->next;
cur->num = 1;
cur->prev = head;
cur->next = NULL;
// Create the third node
cur->next = (se_list*)malloc(sizeof(se_list));
cur->next->prev = cur;
cur = cur->next;
cur->num = -5;
cur->prev = head->next;
cur->next = NULL;
// Create 10 more random nodes
srand(0);
for (int i = 0; i < 10; i++) {
cur->next = (se_list*)malloc(sizeof(se_list));
cur->next->prev = cur;
cur = cur->next;
cur->num = rand() % 20 - 10;
cur->prev = cur->next;
cur->next = NULL;
}
// Print the list forward
cur = head;
while (cur != NULL) {
printf("%d ", cur->num);
cur = cur->next;
}
printf("\n");
// Free the memory
cur = head;
while (cur != NULL) {
se_list* next = cur->next;
free(cur);
cur = next;
}
return 0;
}
THANKS
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 3 steps with 4 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)