#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 deletes the node with value "Boston" from the list when added at point of insertion indicated above? O list->next = p; delete p; p = list->next; list->next = p->next; delete p; p = list->next; list = p->next; delete p: O None of these p = list->next; list->next = p: delete p;

#include <iostream>using namespace std;class st{private:int arr[100];int top;public:st(){top=-1;}void push(int ItEM) {top++;arr[top]=ItEM; }bool ise() {return top<0;} int pop(){int Pop;if (ise()) cout<<"Stack is emptye ";else{Pop=arr[top];top--;return Pop;}}int Top(){int TOP;if (ise()) cout<<" empty ";else {TOP=arr[top];return TOP;}}void screen(){ for (int i = 0; i <top+1 ; ++i) {cout<<arr[i];} }};int main() {st c;c.push(1);c.push(2);c.push(3);c.push(4);c.pop();c.push(5);c.screen();return 0;} alternative to this code??

#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

int tryMe(int x[], int size); void main() { int list[75]; cout<< tryMe (list, 75); } valid invalid

// 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…

Matrix.h #include <iostream>#include <iomanip>using namespace std; #ifndef MATRIX_H#define MATRIX_Hclass Matrix{    friend ostream& operator<<(ostream& out, const Matrix& srcMatrix);public:    Matrix();    // initialize Matrix class object with rowN=1, colN=1, and zero value    Matrix(const int rN,const int cN );    // initialize Matrix class object with row number rN, col number cN and zero values    Matrix(const Matrix &srcMatrix );    // initialize Matrix class object with another Matrix class object    Matrix(const int rN, const int cN, const float *srcPtr);     // initialize Matrix class object with row number rN, col number cN and a pointer to an array     const float * getData()const;    // create a temp pointer and copy  the array values  which data pointer points,    // then returns temp.    int getRowN()const; // returns rowN    int getColN()const; // returns colN    void print()const;  // prints the Matrix object in rowNxcolN form    Matrix…

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

// 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…

Concatenate Map This function will be given a single parameter known as the Map List. The Map List is a list of maps. Your job is to combine all the maps found in the map list into a single map and return it. There are two rules for addingvalues to the map. You must add key-value pairs to the map in the same order they are found in the Map List. If the key already exists, it cannot be overwritten. In other words, if two or more maps have the same key, the key to be added cannot be overwritten by the subsequent maps.   Signature:   public static HashMap<String, Integer> concatenateMap(ArrayList<HashMap<String, Integer>> mapList) Example: INPUT: [{b=55, t=20, f=26, n=87, o=93}, {s=95, f=9, n=11, o=71}, {f=89, n=82, o=29}]OUTPUT: {b=55, s=95, t=20, f=26, n=87, o=93} INPUT: [{v=2, f=80, z=43, k=90, n=43}, {d=41, f=98, y=39, n=83}, {d=12, v=61, y=44, n=30}]OUTPUT: {d=41, v=2, f=80, y=39, z=43, k=90, n=43} INPUT: [{p=79, b=10, g=28, h=21, z=62}, {p=5, g=87, h=38}, {p=29,…

#include <iostream>#include <list>#include <string>#include <cstdlib>using namespace std;int main(){int myints[] = {};list<int> l, l1 (myints, myints + sizeof(myints) / sizeof(int));list<int>::iterator it;int choice, item;while (1){cout<<"\n---------------------"<<endl;cout<<"***List Implementation***"<<endl;cout<<"\n---------------------"<<endl;cout<<"1.Insert Element at the Front"<<endl;cout<<"2.Insert Element at the End"<<endl;cout<<"3.Front Element of List"<<endl;cout<<"4.Last Element of the List"<<endl;cout<<"5.Size of the List"<<endl;cout<<"6.Display Forward List"<<endl;cout<<"7.Exit"<<endl;cout<<"Enter your Choice: ";cin>>choice;switch(choice){case 1:cout<<"Enter value to be inserted at the front: ";cin>>item;l.push_front(item);break;case 2:cout<<"Enter value to be inserted at the end:…