Write the code necessary to convert the following sequence of ListNode objects: list -> [5] -> [4] -> [3] / Into this sequence of ListNode objects: list -> [3] -> [4] -> [5] /

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 () {…

Assignment1: Analyse the case study given in chapter 3 Linked listAnswer the following questions from Library.java1. Write the different class names with class keyword chapter 3 Linked list : https://drive.google.com/file/d/1NRN_3Fx3smkjwv1jgG8hzaiGfnNfeeDb/view?usp=sharing

Tree  Define a class called TreeNode containing three data fields: element, left and right. The element is a generic type. Create constructors, setters and getters as appropriate.  Define a class called BinaryTree containing two data fields: root and numberElement. Create constructors, setters and getters as appropriate.  Define a method balanceCheck to check if a tree is balanced. A tree being balanced means that the balance factor is -1, 0, or 1.

Assume you have a class SLNode representing a node in a singly-linked list and a variable called list referencing the first element on a list of integers, as shown below: public class SLNode { private E data; private SLNode next; public SLNode( E e){ data = e; next = null; } public SLNode getNext() { return next; } public void setNext( SLNoden){ next = n; } } SLNode list; Write a fragment of Java code that would append a new node with data value 21 at the end of the list. Assume that you don't know if the list has any elements in it or not (i.e., it may be empty). Do not write a complete method, but just show a necessary fragment of code.

#include <iostream> usingnamespace std; class Queue {     int size;     int* queue;         public:     Queue(){         size = 0;         queue = new int[100];     }     void add(int data){         queue[size]= data;         size++;     }     void remove(){         if(size ==0){             cout <<"Queue is empty"<<endl;             return;         }         else{             for(int i =0; i < size -1; i++){                 queue[i]= queue[i +1];             }             size--;         }     }     void print(){         if(size ==0){             cout <<"Queue is empty"<<endl;             return;         }         for(int i =0; i < size; i++){             cout<<queue[i]<<" <- ";         }         cout << endl;     }     //your code goes here     }; int main(){     Queue q1;     q1.add(42); q1.add(2); q1.add(8);  q1.add(1);     Queue q2;     q2.add(3); q2.add(66); q2.add(128);  q2.add(5);     Queue q3 = q1+q2;     q3.print();…

1 Assume some Node class with info & link fields. Complete this method in class List that returns a reference to the node containing the data item in the argument find This, Assume that find this is in the list public class List { protected Node head; protected int size; fublic Public Node find (char find This)

In java The following is a class definition of a linked list Node:class Node{int info;Node next;}Assume that head references a linked list and stores in order, the int values 5, 7 and 9.  Show the instructions needed to delete the Node with 5 so that head would reference the list 7 and 9.

what is the problem in the display function ?  the code :    #include <iostream>using namespace std; class node{public:    int data;    node* next;}; void display(node * head) // printing the data of the nodes{    node* temp = head;     while (temp != NULL) {        cout << temp->data << endl;        temp = temp->next;    }} // add                                                void push(node** head, int newdata)                    // { 5, 10 , 20 , 30 , 40 }{    node* newnode = new node();    newnode->data = newdata;    newnode->next = *head;    *head = newnode;} void append(node** head, int newdata)                // { 10 , 20 , 30 , 40 }{    node* newnode = new node();    newnode->data = newdata;    newnode->next = NULL;     node* last = *head;     if (*head == NULL) {        *head = newnode;        return;    }     while (last->next != NULL)    {        last = last->next;    }    last->next = newnode;} void insertafter(node*…

1.Assume some Node class with info link fields . Complete this method in class List that returns a reference to the node containing the data item in the argument findThis, Assume that findThis is in the list    public class list  { protected Node head ; Protected int size ; Public Node find (char find this)     {     Node curr = head;        while(curr != null)       {         if(curr.info == findThis)             return curr;         curr = curr.link;       }         return -1;                               } }