code in C++fill in under //Free memory allocated A linked list is a series of nodes, where each node in the list points to the next. The last node points tonullptr.In the program below, free the memory allocated by the linked list.dynamic.cpp1 #include 2 #include 3 using namespace std;4struct Node{int value;Node* next;7};10int main(){131112// Create a list of nodesNode* list = new Node{42, new Node{13, new Node{75, nullptr}}};1415// Print the listfor (auto i = list; i != nullptr; i = i->next){cout « i->value <« " ";1617181920}cout « endl;212223//Free the memory allocated24252627}

#include <iostream>#include <string>using namespace std; struct Node{ int value;…

A linked list is a series of nodes, where each node in the list points to the next. The last node points to nullptr.In the program below, free the memory allocated by the linked list. dynamic.cpp 1 #include 2 #include 3 using namespace std; 4 5 struct Node 6 { int value; Node* next; 7 8. }; 10 int main() { // Create a list of nodes Node* list = new Node{42, new Node(13, new Node(75, nullptr}}}; 11 12 13 14 15 // Print the list for (auto i = list; i != nullptr; i = i->next) { cout « i->value « " "; } cout « endl; 16 17 18 19 20 21 22 23 //Free the memory allocated 24 25 26 27

A linked list is a series of nodes, where each node in the list points to the next. The last node points to nullptr.In the program below, free the memory allocated by the linked list. dynamic.cpp 1 #include 2 #include 3 using namespace std; 4 5 struct Node 6 { int value; Node* next; 7 8. }; 10 int main() { // Create a list of nodes Node* list = new Node{42, new Node(13, new Node(75, nullptr}}}; 11 12 13 14 15 // Print the list for (auto i = list; i != nullptr; i = i->next) { cout « i->value « " "; } cout « endl; 16 17 18 19 20 21 22 23 //Free the memory allocated 24 25 26 27

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In Java, The following is a class definition of a linked list Node: class Node{int info;Node next;}Assume that head references a linked list and stores in order, the int values 5, 2 and 9. Show the instructions needed to move the value 2 in front of the value 5 so that the list is now 2, 5 and 9.
Assume a linked list contains following integers: 7, 2, x, 5, 8, x, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; curNode=curNode->getNext(); curNode=curNode->getNext(); int a; a=curNode->getItem(); 1. x 2. 2 3. 7 4. x+9
Using C++(DSA, Topic: Singly linked list) Write a simple airline ticket reservation program. The program should display a menu with the following operations: reserve a ticket, cancel a reservation, check whether a ticket is reserved for person, and display the passengers. The information is maintained on an alphabetized linked list of names. In a simper version of the program, assume that tickets are reserved for only one flight. In a fuller version, place no limit on the number of flights. Create a linked list of flights with each node including pointer to a linked list of passengers. Note: Screen shot of working Demo will be shown.
Write a program which will concatenate two single linked lists. The structure is defined below. Assume that head1 contains the starting address of the first list and head2 contains the starting address of the second list. You need to join them together so that all the students’ roll no and names of both the lists will be displayed together with the help of head1 pointer. struct link { int rollno; char name[20]; struct link *next; }; typedef struct link node; node *head1=NULL, *head2=NULL; //global declaration
struct node{ int a; struct node * nextptr; }; Write two functions. One for inserting new values to a link list that uses the given node structure. void insert(struct node **head, int value); Second function is called to count the number of even numbers in the link list. It returns an integer that represents the number of even numbers. int countEvenNumbers(struct node *head); Write a C program that reads a number of integers from the user and insert those integers into a link list (use insert function). Later pass the head pointer of this link list to a function called countEvenNumbers. This function counts and returns the number of even numbers in the list. The returned value will be printed on the screen. Note 1: Do not modify the function prototypes. Sample Input1: Sample Output1: 45 23 44 12 37 98 33 35 -1 3 Sample Input2: Sample Output2: 11 33 44 21 22 99 123 122 124 77 -1 4
JAVA CODE PLEASE Linked List Practice ll by CodeChum Admin Write a function printNodes that takes in the head of a linked list and prints all the values of that linked list using a while loop. Print the values separated by a [space]->[space] In the main function, write a program that asks the user to input five integers and assign these values to the nodes. Arrange the nodes in ascending order first before printing them using the printNodes function. Input 1. One line containing an integer 2. One line containing an integer 3. One line containing an integer 4. One line containing an integer 5. One line containing an integer Output Enter·number·1:·1 Enter·number·2:·2 Enter·number·3:·3 Enter·number·4:·4 Enter·number·5:·5 1·->·2·->·3·->·4·->·5
Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; curNode=curNode->getNext(); curNode=curNode->getNext(); int a=curNode->getItem()<<endl; Group of answer choices A.4 B.2 C.5 D.6
Assume a linked list contains following integers: 7, 2, 9, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a; while(curNode->getNext()!=NULL){ { curNode=curNode->getNext(); } a=curNode->getItem(); A. 15 B. 7 C. 49 D. 3
Assume a linked list contains following integers: 2, 2, 4, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; while(curNode->getItem()<7){ a+=curNode->getItem(); curNode=curNode->getNext(); } A. 13 B. 5 C. 8 D. 21
JAVA CODE PLEASE 2. Linked List Quiz by CodeChum Admin Write a function printNodes that takes in the head of a linked list and prints all the values of that linked list using a while loop. Print the values separated by a [space]->[space] Create a program that accepts 10 integer inputs. Assign each input into a node and link them in ascending order then print the linked list. Create another two linked lists: One for nodes with even numbers and the other one for odd numbers. Print them respectively using the printNodes function. Input 1. One line containing an integer 2. One line containing an integer 3. One line containing an integer 4. One line containing an integer 5. One line containing an integer 6. One line containing an integer 7. One line containing an integer 8. One line containing an integer 9. One line containing an integer 10. One line containing an integer Output Enter·number·1:·1 Enter·number·2:·2 Enter·number·3:·3 Enter·number·4:·4…
Assume a linked list contains following integers: 5, 2, 4, 6, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode=head; int a=0; while(curNode!=NULL){ a+=curNode->getItem(); curNode=curNode->getNext(); if(curNode!=NULL) curNode=curNode->getNext(); } A.32 B.43 C.19 D.18
Assume a linked list contains following integers: 2, 2, 4, 5, 8, 3, 15 and the pointer head is pointing to the first node of the list. What will be the value of variable a after the following statements are executed: Node<int> *curNode; curNode=new Node<int>(10,head); head=curNode; int a; while(curNode!=NULL){ a+=curNode->getItem(); curNode=curNode->getNext(); } A.49 B.39 C.7 D.15