You are to implement an interactive dynamic single Linked List structure. This List will be based on the node definition given on the next page. Since you already know how to create classes, this should be a logical extension. Your goal is to create a Linked List class which contains "node" elements. Your program should contain the ability to dynamically (meaning the user can select what each choice at anytime): 1. Insert at head (new node at head) 2. Insert at tail (new node placed at the end of the list) 3. Print (prints out the contents of the list in order) 4. Remove from head (remove first node) [watch special case]] 5. Remove from tail (remove last node) (watch special cases] 6. Find a target value (an isThere routine) (tells you if the target is in the list) 7. Give total # of occurrences of a specified value (how many items of target are in the list) 8. Give a total # of nodes (total items in list) This program will track integers from the user. Be aware that some of these methods above will force you to create other routines/methods. You are coding dynamic structures - code accordingly. See page 2 for more specificity on the methods. Doliverables: 1) Clearly documented, professionally written source code (in a running form) 2) 3 runs showing all the user menu items. (output) (screenshots are fine) 3) Grading is based on: a) Meets all requirements (80%) b) Quality of source code (comments, logic, pre/post conditions, etc.) (20%) For extra credit, you may do the following: (will require research on your own) [DO NOT DO THIS UNLESS YOUR PROGRAM ALREADY FULLY WORKSI 1) Upgrade the "insert" method to allow for a "variable location insert". (this isn't easy) (5%) 2) Attempt to make 1 or more of the methods recursive. (5%)

In Java please help with the following:   Sees whether this list is empty.@return True if the list is empty, or false if not. */ public boolean isEmpty(); } // end ListInterface Hint:Node class definition should look something like: public class Node<T> { T element; Node next; Node prev; public Node(T element, Node next, Node prev) { this.element = element;this.next = next;this.prev = prev; } }

JAVA please Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts Code provided in the assignment ItemNode.java:

Given the interface of the Linked-List struct Node{     int data;     Node* next = nullptr; }; class LinkedList{ private:     Node* head;     Node* tail; public:     display_at(int pos) const;     ... };   Write a definition for a method display_at. The method takes as a parameter integer that indicates the node's position which data you need to display.  Example: list: 5 -> 8 -> 3 -> 10 display_at(1); // will display 5 display_at(4); // will display 10   void LinkedList::display_at(int pos) const{      // your code will go here  }

PYTHON LAB: Inserting an integer in descending order (doubly-linked list) Given main.py and an IntNode class, complete the IntList class (a linked list of IntNodes) by writing the insert_in_descending_order() method to insert new IntNodes into the IntList in descending order. Ex. If the input is: 3 4 2 5 1 6 7 9 8 the output is: 9 8 7 6 5 4 3 2 1   _____________________________________________________________________________________   Main.py: from IntNode import IntNode from IntList import IntList   if __name__ == "__main__":     int_list = IntList()         input_line = input()     input_strings = input_line.split(' ')         for num_string in input_strings:         # Convert from string to integer         num = int(num_string)           # Insert into linked list in descending order         new_node = IntNode(num)         int_list.insert_in_descending_order(new_node)             int_list.print_int_list() IntNode.py class IntNode:     def __init__(self, initial_data, next = None,…

This is using Data Structures in Java

You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…

Having trouble with creating the InsertAtEnd function in the ItemNode.h file below.  "    // TODO: Define InsertAtEnd() function that inserts a node    //       to the end of the linked list" Given main(), define an InsertAtEnd() member function in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts  ------------------------------------------------------- main.cpp -------------------------------------------------------- #include "ItemNode.h" int main() {    ItemNode *headNode;  // Create intNode objects                                                       ItemNode *currNode;    ItemNode *lastNode;     string item;    int i;    int input;     // Front of nodes list                                                                             headNode = new ItemNode();    lastNode = headNode;     cin >> input;     for (i = 0; i < input; i++) {        cin >> item;…

True or False  For each statement below, indicate whether you think it is True or False. If you like, you can provide a description of your answer for partial credit in case you are incorrect. Use the standard linked list below to answer True/False statements 9-12:     8 7 null 4 10                    The “head” pointer of this list is pointing to Node 4 If we called “insert(5)”, the new node’s “next” pointer will point to Node 8 If we called “delete(10)”, Node 7’s “next” pointer will point to Node 8 If we called “search(20)”, the “head” pointer will be at Node 4 after the search function ends

Which best describes this axiom: aList.getLength ( ) = ( aList.remove ( i ) ) . getLength ( ) + 1     You cannot remove an item from from existing list that is empty      Removing an item from an existing list decreases its length by one     Removing an item from an existing list increases the list size by one     None of these