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

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

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…

Questions: There needs to be a dynamic array of Child that opposes with SCALE and is assigned to "familyTree". The createFamilyTree() function needs to be defined. Please see the C++ code.

#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:…

2 ) Pascal triangle write a function(in OCaml)  val nextpascalrow : int list -> int list = that given a list of integers that correspond to a row of the pascal triangle, it calculates the next row of the pascal triangle. # nextpascalrow [1; 6; 15; 20; 15; 6; 1];; - : int list = [1; 7; 21; 35; 35; 21; 7; 1]

C++ Data Structure:Create an AVL Tree C++ class that works similarly to std::map, but does NOT use std::map. In the PRIVATE section, any members or methods may be modified in any way. Standard pointers or unique pointers may be used.** MUST use given Template below: #ifndef avltree_h#define avltree_h #include <memory> template <typename Key, typename Value=Key> class AVL_Tree { public:      classNode {      private:          Key k;          Value v;          int bf; //balace factor          std::unique_ptr<Node> left_, right_;          Node(const Key& key) : k(key), bf(0) {}          Node(const Key& key, const Value& value) : k(key), v(value), bf(0) {}      public:          Node *left() {              return left_.get();      }      Node *right() {          return right_.get();      }      const Key& key() const {          return k;      }      const Value& value() const {          return v;      }      const int balance_factor() const {…

#include <bits/stdc++.h> using namespace std;   struct Employee {     string firstName;     string lastName;     int numOfHours;     float hourlyRate;     char major[2];     float amount;     Employee* next; }; void printRecord(Employee* e) {     cout << left << setw(10) << e->lastName << setw(10) << e->firstName << setw(12)         << e->numOfHours << setw(12) << e->hourlyRate << setw(10) << e->amount         << setw(9) << e->major[0]<< setw(7) << e->major[1]<<endl; }   void appendNode(Employee*& head, Employee* newNode) {     if (head == nullptr) {         head = newNode;     } else {         Employee* current = head;         while (current->next != nullptr) {             current = current->next;         }         current->next = newNode;     } }       void displayLinkedList(Employee* head) {     Employee* current = head; if(current!=nullptr){   cout…

#include <bits/stdc++.h> using namespace std;   struct Employee {     string firstName;     string lastName;     int numOfHours;     float hourlyRate;     char major[2];     float amount;     Employee* next; }; void printRecord(Employee* e) {     cout << left << setw(10) << e->lastName << setw(10) << e->firstName << setw(12)         << e->numOfHours << setw(12) << e->hourlyRate << setw(10) << e->amount         << setw(9) << e->major[0]<< setw(7) << e->major[1]<<endl; }   void appendNode(Employee*& head, Employee* newNode) {     if (head == nullptr) {         head = newNode;     } else {         Employee* current = head;         while (current->next != nullptr) {             current = current->next;         }         current->next = newNode;     } }       void displayLinkedList(Employee* head) {     Employee* current = head; if(current!=nullptr){   cout…