Write the code necessary to convert the following sequence of ListNode objects: list -> [1] -> [2] -> [3] / Into these sequences of ListNode objects: list -> [2] / list2 -> [1] -> [³] / Assume that you are using ListNode class as defined in the textbook: 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() {...} public ListNode(int data) { ... } public ListNode(int data, ListNode next) { ... }

Read this: Complete the code in Visual Studio using C++ Programming Language                   - Give me the answer in Visual Studio so I can copy***                   - Separate the files such as .cpp, .h, or .main if any!   Develop a C++ "doubly" linked list class of your own that can hold a series of signed shorts Develop the following functionality: Develop a linked list node struct/class You can use it as a subclass like in the book (Class contained inside a class) You can use it as its own separate class Your choice Maintain a private pointer to a node class pointer (head) Constructor Initialize head pointer to null Destructor Make sure to properly delete every node in your linked list push_front(value) Insert the value at the front of the linked list pop_front() Remove the node at the front of the linked list If empty, this is a no operation operator << Display the contents of the linked list just like you would print a character string operator [] Treat like…

Consider the code below. #include using namespace std; struct ListNode { string data; ListNode *next; }; int main() { ListNode *ptr, *list; list = new ListNode; list->data = "Boston"; list->next = new ListNode; %D list->next->data = "Houston"; list->next->next = nullptr; ptr = new ListNode; ptr->data = "New York"; ptr->next = list; list = ptr; %3D // new code goes here Copyright 2016-2021 by A.Berrached-- All Rights Reserved. Write C++ code to create and insert a new node with data field "Miami" after the node with data filed "Boston". Edit Format Table

ASSUMING C LANGUAGE True or False: You can have the data portion of a Linked List be a Struct containing a Linked List itself

Input code in the "Write code here" sections

Consider the following piece of code. #include using namespace std; struct ListNode { string data; ListNode *next; }; int main() { ListNode *ptr, *list; list = new ListNode; list->data = "Boston"; list->next = new ListNode; list->next->data = "Houston"; list->next->next = nullptr; ptr = new ListNode; ptr->data = "New York"; ptr->next = list; list = ptr; // new code goes here Copyright 2016-2021 by A.Berrached- All Rights Reserved. Write C++ code to create and insert a new node with data field "Atlanta" after the node with data filed "New York". Edit Format Table WP Paragraph v |BIU Av ev T?v| 12pt v

for c++ please thank you  please type the code so i can copy and paste easily thanks. 4, List search  Modify the linked listv class you created in the previous programming challange to include a member function named search that returns the position of a specific value, x, in the lined list. the first node in the list is at position 0, the second node is at position 1, and so on. if x is not found on the list, the search should return -1 test the new member function using an approprate driver program. here is my previous programming challange. #include <iostream> using namespace std; struct node { int data; node *next; }; class list { private: node *head,*tail; public: list() { head = NULL; tail = NULL; } ~list() {    } void append() { int value; cout<<"Enter the value to append: "; cin>>value; node *temp=new node; node *s; temp->data = value; temp->next = NULL; s = head; if(head==NULL) head=temp; else { while (s->next != NULL) s = s->next; s->next =…

hello. This is my code:  #include <stdio.h>#include <stdlib.h>#include <string.h> typedef struct HuffmanNode {    int character;    float frequency;    struct HuffmanNode* left;    struct HuffmanNode* right;} HuffmanNode; typedef struct HeapNode {    HuffmanNode* node;    struct HeapNode* next;} HeapNode; HuffmanNode* create_huffman_node(int character, float frequency) {    HuffmanNode* node = (HuffmanNode*)malloc(sizeof(HuffmanNode));    node->character = character;    node->frequency = frequency;    node->left = NULL;    node->right = NULL;    return node;} HeapNode* create_heap_node(HuffmanNode* node) {    HeapNode* heap_node = (HeapNode*)malloc(sizeof(HeapNode));    heap_node->node = node;    heap_node->next = NULL;    return heap_node;} HeapNode* insert_into_heap(HeapNode* heap, HuffmanNode* node) {    HeapNode* heap_node = create_heap_node(node);     if (heap == NULL) {        return heap_node;    }     // Compare nodes based on probability and…

Lab 19 Building a linked list Start this lab with the code listed below. The LinkedList class defines the rudiments of the code needed to build a linked list of Node objects. You will first complete the code for its addFirst method. This method is passed an object that is to be added to the beginning of the list. Write code that links the passed object to the list by completing the following tasks in order: 1. Create a new Node object. 2. Make the data variable in the new Node object reference the object that was passed to addFirst. 3. Make the next variable in the new Node object reference the object that is currently referenced in variable first. 4. Make variable first reference the new Node. Test your code by running the main method in the LinkedListRunner class below. Explain, step by step, why each of the above operations is necessary. Why are the string objects in the reverse order from the way they were added? public class LinkedList { private Node first; public LinkedList () {…

C++ Program  #include <iostream>#include <cstdlib>#include <ctime>using namespace std; int getData() {    return (rand() % 100);} class Node {public:    int data;    Node* next;}; class LinkedList{public:    LinkedList() { // constructor        head = NULL;    }    ~LinkedList() {}; // destructor    void addNode(int val);    void addNodeSorted(int val);    void displayWithCount();    int size();    void deleteAllNodes();    bool exists(int val);private:    Node* head;}; // function to check data exist in a listbool LinkedList::exists(int val){         if (head == NULL) {        return false;    }    else {        Node* temp = head;        while (temp != NULL) {                       if(temp->data == val){                return true;            }            temp = temp->next;        }    }    return false;} // function to delete all data in a listvoid LinkedList::deleteAllNodes(){        if (head == NULL) {        cout << "List is empty, No need to delete…