Consider the following code: #include using namespace std; struct ListNode { string data; ListNode *next; }; int main() { ListNode *p, *list; list = new ListNode; list->data= "New York"; p - new ListNode; p->data - "Boston"; list->next - p; p->next - new ListNode; p->next->data - "Houston"; p->next->next = nullptr; // new code goes here Which of the following code correctly inserts "Chicago" at end of the list when added at point of insertion indicated above? p - list->next->next; p->next = new ListNode; p = p->next;: p->data = "Chicago"; p->next = nullptr; p - new ListNode; p->data - "Chicago"; p->next - nullptr; list->next->next = p; O None of these p - new ListNode: p->data - "Chicago"; p->next - nullptr; p->next->next->next - list; O O

Task 1: Consider the following structure: struct student { int id; float cgpa; }list[10]; a) Write a complete C++ program that scans 10 student IDs and corresponding cgpa into the array list. b) Write a function to display all the contents of the structure. Task 2: Write the following functions: a) A function that finds the maximum cgpa. The function should display the student id and cgpa of the student holding the maximum cgpa. b) A function that displays the students who scored cgpa above the average cgpa. First , find the average cgpa, then traverse the array and display those having cgpa above the average.

O problem 12 Language/Type: Related Links: Author: Java ListNodes LinkedLists LinkedIntList.java Marty Stepp Write the code necessary to convert the following sequence of ListNode objects: list -> [5] -> [4] -> [3] / Into this sequence of ListNode objects: list [4] -> [5] -> [3] / Assume that you are using ListNode class as defined in lecture and section: public class ListNode { public int data; // data stored in this node public ListNode next; // a link to the next node in the list } public ListNode () { ode() {...} public ListNode(int data) { ... } public ListNode(int data, ListNode next) { ... }

#ifndef LLCP_INT_H#define LLCP_INT_H #include <iostream> struct Node{   int data;   Node *link;};void DelOddCopEven(Node*& headPtr);int    FindListLength(Node* headPtr);bool   IsSortedUp(Node* headPtr);void   InsertAsHead(Node*& headPtr, int value);void   InsertAsTail(Node*& headPtr, int value);void   InsertSortedUp(Node*& headPtr, int value);bool   DelFirstTargetNode(Node*& headPtr, int target);bool   DelNodeBefore1stMatch(Node*& headPtr, int target);void   ShowAll(std::ostream& outs, Node* headPtr);void   FindMinMax(Node* headPtr, int& minValue, int& maxValue);double FindAverage(Node* headPtr);void   ListClear(Node*& headPtr, int noMsg = 0); // prototype of DelOddCopEven of Assignment 5 Part 1 #endif

// FILE: DPQueue.h// CLASS PROVIDED: p_queue (priority queue ADT)//// TYPEDEFS and MEMBER CONSTANTS for the p_queue class://   typedef _____ value_type//     p_queue::value_type is the data type of the items in//     the p_queue. It may be any of the C++ built-in types//     (int, char, etc.), or a class with a default constructor, a//     copy constructor, an assignment operator, and a less-than//     operator forming a strict weak ordering.////   typedef _____ size_type//     p_queue::size_type is the data type considered best-suited//     for any variable meant for counting and sizing (as well as//     array-indexing) purposes; e.g.: it is the data type for a//     variable representing how many items are in the p_queue.//     It is also the data type of the priority associated with//     each item in the p_queue////   static const size_type DEFAULT_CAPACITY = _____//    p_queue::DEFAULT_CAPACITY is the default initial capacity of a//    p_queue that is created by the default…

C++ Create a function called findData that will take the following parameter: “CHOICE, KEY”. Choice will determine which traversal will be used to traverse the tree for the second parameter KEY. If the KEY is found, the value will be displayed such that: “{KEY} was found!”.   #include<iostream>#include<queue>struct treeNode{char dataItem;struct treeNode *firstChild;struct treeNode *nextSibling;};/* Preorder Traversalpreorder (v)visit(v)for each child w of vpreorder(w)*/void preorder(treeNode *currNode){if(currNode != NULL){std::cout << currNode->dataItem << " ";preorder(currNode->firstChild);preorder(currNode->nextSibling);}return;}/* Postorder Traversalpostorder (v)for each child w of vpostOrder(w)visit(v)*/void postorder(treeNode *currNode){if(currNode != NULL){preorder(currNode->firstChild);preorder(currNode->nextSibling);std::cout << currNode->dataItem << " ";}return;}/*Inorder Traversalif(v==NULL)…

Help fill in code! #if !defined(PRODUCE_H_INCL)#define PRODUCE_H_INCL#define PRODUCE_NAME 21typedef struct produce {char name[PRODUCE_NAME];int inven;} produce_t;typedef struct list_node {produce_t data;struct list_node *restp;} list_node_t;typedef struct produce_list {/* fill in the code to declare a list_node_t pointer called head */int size;} produce_list_t;void read_produce_file (char filename[], produce_list_t *p);void print_produce (produce_t prod);void print_produce_list (produce_list_t p);void write_produce_file (char filename[], produce_list_t p);list_node_t * search_produce_list (produce_list_t p, char name[]);int update_produce_list (produce_list_t *p, produce_t prod);void print_produce_linked_list (produce_list_t p);#endif

Question 3 Consider the following piece of code. #include using namespace std; struct ListNode { string data; ListNode *next; }; int main() { ListNode *ptr, *list; ptr = new ListNode; ptr->data = "San Antonio"; ptr->next = new ListNode; ptr->next->data. = "Dallas"; ptr->next->next = nullptr; list = new ListNode; list->data = "Austin"; list->next = ptr; Write C++ code to delete the node with data field "Dallas" from the list. Edit Format Table 12pt v Paragraph v |BIUA v 2v T?v|| WP

C++ Binary Search Tree program Create a class "Person" with three member variables string first name, string last name, int age. The primary key will be the last name. User will be prompted with a menu with two options: 1, "Enter person", where they will enter the persons first name, last name and age, or 2, "View person list" where the person may view the information previously added.

// FILL IN THE BLANKS (LINKED-LISTS CODE) (C++)#include<iostream>using namespace std; struct ________ {int data ;struct node *next; };   node *head = ________;node *createNode() { // allocate a memorynode __________;temp = new node ;return _______ ;} void insertNode(){node *temp, *traverse;int n;cout<< "Enter -1 to end "<<endl;cout<< "Enter the values to be added in list"<<endl;cin>>n; while(n!=-1){temp = createNode(); // allocate memorytemp->data = ________;temp->next = ________;if ( ___________ == NULL){head = _________;} else {traverse = ( );while (traverse->next != ________{traverse = traverse-> ___________;} traverse->next= temp;} cout<<"Enter the value to be added in the list"<<endl;cin>>n; }} void printlist(){node *traverse = head; // if head == NULLwhile (traverse != NULL) { cout<<traverse->data<<" ";traverse = traverse->next;}} int main(){int option; do{cout<<"\n =============== MAIN…