Answer each question given this definition of a linked list. Assume the list has already been constructed and contains at least one 0.struct ListNode { // a data type double value; ListNode *next;};ListNode *head;Write C++ statements to output a count of how many times the number 0 occurs in the list. If the list contains the values {1.2, 3.2, 0, 7.8, 0, 5, 0} it should output 3 because 0 occurs 3 times in the list.Write C++ statements to declare a pointer p of type ListNode * and make it point to the node BEFORE the first 0 in the list. If the list contains the values {1.2, 3.2, 0, 7.8, 0, 5, 0}, p should point to the 3.2. Your code should work for any list that contains a 0. You may assume the first value is NOT a 0.Remove the node containing the first 0 in the list (and deallocate it). Assume p is of type ListNode * and is already pointing to the node BEFORE the first 0, and that the first value in the list is NOT a 0.

Since multiple questions have been posted at a single request, we will answer first question. If you want any other question to be answered, kindly post that question separately.A C++ program to output a count of how many times the number "0" occurs in the list is as follows, Program: #include<iostream> using namespace std; class ListNode { //a data type public: double value; ListNode* next; }; ListNode* head; //Define a function to push a new node to the front of the list void insert(ListNode** headP, double newVal) { ListNode* newNode= new ListNode(); newNode->value = newVal; newNode->next = (*headP); (*headP) = newNode; } //Define a function to count the number of times a node occurs in the list int count(ListNode* headP, double searchValue) { ListNode* currentNode = headP; int countOccur = 0; while (currentNode != NULL) { if (currentNode->value == searchValue) countOccur++; currentNode = currentNode->next; } return countOccur; } int main() { //Create empty list head= NULL; /*Add these values into the list {1.2, 3.2, 0, 7.8, 0, 5, 0}*/ insert(&head, 1.2); insert(&head, 3.2); insert(&head, 0); insert(&head, 7.8); insert(&head, 0); insert(&head, 5); insert(&head, 0); //Call the function and print the returned value as a result cout << "0 occurs " << count(head, 0)<<" times in the list"; return 0; } Screenshot #1: Screenshot #2: Output:

Answered: Answer each question given this…

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

Related questions

Question

Answer each question given this definition of a linked list. Assume the list has already been constructed and contains at least one 0.

struct ListNode { // a data type
double value;
ListNode *next;
};
ListNode *head;

Write C++ statements to output a count of how many times the number 0 occurs in the list. If the list contains the values {1.2, 3.2, 0, 7.8, 0, 5, 0} it should output 3 because 0 occurs 3 times in the list.
Write C++ statements to declare a pointer p of type ListNode * and make it point to the node BEFORE the first 0 in the list. If the list contains the values {1.2, 3.2, 0, 7.8, 0, 5, 0}, p should point to the 3.2. Your code should work for any list that contains a 0. You may assume the first value is NOT a 0.
Remove the node containing the first 0 in the list (and deallocate it). Assume p is of type ListNode * and is already pointing to the node BEFORE the first 0, and that the first value in the list is NOT a 0.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions