Question No: 01: Make a class to implement linked list and Implement the basic functions of Linked list. Constructors(default, parameterized, copy) & destructor • void PrinList(),int search_Element(int x), void Insert_Element(int x), void Insert_Element_at(int x, int pos), bool Delete_Element(int x), bool is_Empty, int Length(), void Print_Reverse_List(), void Empty_List(), void Copy_List(...) • Also write a driver (main) program to test your code (provide menu for all operations)

What is the biggest advantage of linked list over array? Group of answer choices Unlike array, linked list can dynamically grow and shrink With linked list, it is faster to access a specific element than with array Linked list is easier to implement than array Unlike array, linked list can only hold a fixed number of elements

template <class T> class List; template <class T> class Node{ friend class List<T>; private:  T data;         Node* link; }; template <class T> class List{ public:     List(){first = 0;}     void InsertBack(const T& e);     void Concatenate(List<T>& b); void Reverse(); class Iterator{ …. }; Iterator Begin(); Iterator End(); private:     Node* first; };   I need algorithm , I think it may use iterator to complile.   The question shows on below photo.

Could you help me the following question?   The Node structure is defined as follows (we will use integers for data elements):   public class Node {             public int data;             public Node next;             public Node previous; }   The Double Ended Doubly Linked List (DEDLL) class definition is as follows:   public class DEDLL {             public int currentSize;             public Node head;             public Node tail; }   This design is a modification of the standard linked list. In the standard that we discussed in class, there is only a head node that represents the first node in the list and each node only contains a reference to the next node in the list until the chain of nodes reach null. In this DEDLL, each node also has a reference to the previous node. The DEDLL also contains a reference to the tail of the list that represents the last node in the list.   For example, a DEDLL with 4 elements may have nodes with values 5, 2, 6, and 8 from head to tail. This…

Create a ToArray function for the LinkedList class that returns an array from a linked list instance.

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.

Develop an algorithm and write a C++ program that counts the letter occurrence in the string; make sure you use call by reference to the array of a class with letter and count as private member attributes when return from parse function. For the class member methods, provide the public accessor and modifier as well as print functions for the private member attributes. Write a test program that reads a C-string and displays the number of letters [a-z] and number of numbers [0-9] in the string. In addition to that, you need to output the histogram of the letter and count array. Here is a sample run of the program: <Output> Enter a string: 2023 is coming The number of letters in 2023 is coming is 8 The number of numbers in 2023 is coming is 4 ---- Histogram ---- Char Count 0 1 2 2 3 1 c 1 g 1 i 2 m 1 n 1 /* not a completed output */ <End Output>

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; };

/** * This class will use Nodes to form a linked list. It implements the LIFO * (Last In First Out) methodology to reverse the input string. * **/   public class LLStack {            private Node head;            // Constructor with no parameters for outer class      public LLStack( ) {          // to do      }            // This is an inner class specifically utilized for LLStack class,      // thus no setter or getters are needed      private class Node  {         private Object data;         private Node next;                  // Constructor with no parameters for inner class         public Node(){             // to do             // to do         }        // Parametrized constructor for inner class         public Node (Object newData, Node nextLink) {                 // to do: Data part of Node is an Object                // to do:  Link to next node is a type Node         }      }             // Adds a node as the first node element at the start of the list with the specified…

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.