class Linked List ( static class Node { int data; Node next; Node (int data) { this.data = data; } } Node first; // The singly linked list contains only a pointer to the //first node in the list. *Return a list that contains the ids that are present in this list or t * other list. . *@param other the other list.

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…

C++The List class represents a linked list of dynamically allocated elements. The list has only one member variable head which is a pointer that leads to the first element. See the following code for the copy constructor to List. List (const List & list) {          for (int i = 0; i <list.size (); i ++)       {                    push_back (list [i]);           } } What problems does the copy constructor have? Select one or more options: 1. List (const List & list) {} does not define a copy constructor. 2. The list parameter should not be constant. 3. The new elements will be added to the wrong list. 4. Copy becomes shallow rather than deep. 5. The copy will create dangling pointers. 6. Copying will create memory leaks. 7. The condition must be: i <size () 8. head is never initialized.

struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };

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

Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained.  You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data;     Node next;   Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…

C++ The List class represents a linked list of dynamically allocated elements. The list has only one member variable head which is a pointer that leads to the first element. See the following code for the destructor to List. ~ List () {      for (int i = 0; i <size (); i ++)       {             pop_back ();          } } What problems does the destructor have? Select one or more options: 1. There are no parameters for the destructor. 2. The return value from pop_back (if any) is nerver handled. 3. The destructor will create a stack overflow. 4. The destructor will create dangling pointers. 5.The destructor will create memory leaks. 6.The destructor will create undefined behavior (equivalent to zero pointer exception). 7.The condition must be: i <size () - 1 8. There is at least one problem with the destructor, but none of the above.

Make List Items Uppercase 2 in python Define the function make_uppercase(mylist), which takes a list parameter mylist (a list of strings), mutates the list by uppercasing each string in mylist. The function returns None.  For example, if mylist is ['cat', 'Dog', 'frOG'], then the mutated list should  be ['CAT', 'DOG', 'FROG'].    For example: Test Result mylist = ['cat', 'Dog', 'frOG'] result = make_uppercase(mylist) print(mylist) if result != None: print("Error, return value should be None") ['CAT', 'DOG', 'FROG'] mylist = ['baNanas', 'appLes', 'pEAches', 'PEArs'] result = make_uppercase(mylist) print(mylist) if result != None: print("Error, return value should be None") ['BANANAS', 'APPLES', 'PEACHES', 'PEARS']