#include using namespace std; struct ListNode { string data; ListNode *next; }; int main() { ListNode *ptr, list; list = new ListNode; list->data = "New York"; ptr - new ListNode; ptr->data - "Boston"; list->next - ptr; ptr->next= new ListNode; ptr->next->data - "Houston"; ptr->next->next = nullptr; // new code goes here Which of the following code correctly deletes the last node the list when added at point of insertion indicated above? O delete ptr->next; ptr->next = nullptr;; O ptr = list: while (ptr != nullptr) ptr = ptr->next; delete ptr; ptr = last; delete ptr; list->next->next = nullptr; delete ptr;

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…

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

#ifndef INT_SET_H#define INT_SET_H #include <iostream> class IntSet{public:   static const int DEFAULT_CAPACITY = 1;   IntSet(int initial_capacity = DEFAULT_CAPACITY);   IntSet(const IntSet& src);   ~IntSet();   IntSet& operator=(const IntSet& rhs);   int size() const;   bool isEmpty() const;   bool contains(int anInt) const;   bool isSubsetOf(const IntSet& otherIntSet) const;   void DumpData(std::ostream& out) const;   IntSet unionWith(const IntSet& otherIntSet) const;   IntSet intersect(const IntSet& otherIntSet) const;   IntSet subtract(const IntSet& otherIntSet) const;   void reset();   bool add(int anInt);   bool remove(int anInt); private:   int* data;   int  capacity;   int  used;   void resize(int new_capacity);}; bool operator==(const IntSet& is1, const IntSet& is2); #endif

My code from milestone 1  # Define the quiz_type dictionary quiz_type = {     1: "BabyAnimals",     2: "Brooklyn99",     3: "Disney",     4: "Hogwarts",     5: "MyersBriggs",     6: "SesameStreet",     7: "StarWars",     8: "Vegetables" } # Print the welcome message print("Welcome to the Personality Quiz!") print() print("What type of Personality Quiz do you want to run?") print() for number, quiz_name in quiz_type.items():     print(f"{number} - {quiz_name}") print() test_number = int(input("Choose test number (1-8): ")) # Check if the test_number is valid if test_number in quiz_type:     quiz_name = quiz_type[test_number]     print()     print(f"Great! Let's begin the {quiz_name} Personality Quiz...") else:     print("Invalid test number. Please choose a number between 1 and 8.") ------------------------------------------------------------------- Milestone #3 code :   # Ending statements with the period to easily split them as mentioned in the question. questions = [     "I…

#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 <iostream>#include <vector>using namespace std; void PrintVectors(vector<int> numsList) {   unsigned int i;    for (i = 0; i < numsList.size(); ++i) {      cout << numsList.at(i) << " ";   }   cout << endl;} int main() {   vector<int> numsList;   int userInput;   int i;    for (i = 0; i < 3; ++i) {      cin >> userInput;      numsList.push_back(userInput);   }    numsList.erase(numsList.begin()+1);   numsList.insert(numsList.begin()+1, 102);   numsList.insert(numsList.begin()+1, 100);    PrintVectors(numsList);    return 0;} Not all tests passed   clearTesting with inputs: 33 200 10 Output differs. See highlights below. Special character legend Your output 33 100 102 10 Expected output 100 33 102 10 clearTesting with inputs: 6 7 8 Output differs. See highlights below. Special character legend Your output 6 100 102 8 Expected output 100 6 102 8   Not sure what I did wrong but the the 33…