Implement a Single linked list to store a set of Integer numbers (no duplicate), Using Java Language. • Instance variable • Constructor • Accessor and Update methods 1. Define a Node Class. a. Instance Variables      # E element- (generics framework)      # Node Next (pointer) - refer to the next node (Self-referential) b. Constructor c. Methods      # E getElement() //Return the value of this node.      # setElement(E e) // Set value to this node.      # Node getNext() //Return the pointer of this node.      # setNext(Node n) //Set pointer to this node.      # displayNode() //Display information of this node.

import java.util.HashSet; import java.util.Set; // Define a class named LinearSearchSet public class LinearSearchSet {     // Define a method named linearSearch that takes in a Set and an integer target     // as parameters     public static boolean linearSearch(Set<Integer> set, int target) {         // Iterate over all elements in the Set         for () {             // Check if the current value is equal to the target             if () {                 // If so, return true             }         }         // If the target was not found, return false     }     // Define the main method     public static void main(String[] args) {         // Create a HashSet of integers and populate integer values         Set<Integer> numbers = new HashSet<>();         // Define the target to search for         numbers.add(3);         numbers.add(6);         numbers.add(2);         numbers.add(9);         numbers.add(11);         // Call the linearSearch method with the set…

Can someone explain it to me.

@Override// interface method ==================================================public int merge(BST nbt) {/*See BST.java for method specification */// Hint: traverse bst using pre-order// as each node is visited, take the value there// and do this.insert(value)// have to somehow count when an add is successful// so we can return the number of nodes added/* Your code here */return 0; // Dummy return statement. Remove when you implement!} in java  fill out method should merge two bst and not add duplicates

Implement a Single linked list to store a set of Integer numbers (no duplicate) • Instance variable• Constructor• Accessor and Update methods 2.) Define SLinkedList Classa. Instance Variables:     # Node head     # Node tail     # int sizeb. Constructorc. Methods     # int getSize() //Return the number of nodes of the list.     # boolean isEmpty() //Return true if the list is empty, and false otherwise.     # int getFirst() //Return the value of the first node of the list.     # int getLast()/ /Return the value of the Last node of the list.     # Node getHead()/ /Return the head     # setHead(Node h)//Set the head     # Node getTail()/ /Return the tail     # setTail(Node t)//Set the tail     # addFirst(E e) //add a new element to the front of the list     # addLast(E e) // add new element to the end of the list     # E removeFirst()//Return the value of the first node of the list     # display()/ /print out values of all the nodes of the list     # Node search(E key)//check if a given…

7. Given a Queue Q, write a non-generic method that finds the maximum element in the Queue. You may use only queue operations. No other data structure can be used other than queues. The Queue must remain intact after finding the maximum value. Assume the class that has the findMax method implements Comparable. The header of the findMax method: public Comparable findMax(Queue q)

C. package Final;   import java.util.HashSet;   public class LLCycle_FE {     public static void main(String[] args) {         Node head = buildLL();        // Given the above linked list write the 2 methods below (removeDuplicates and showLL)         System.out.printf("\n --------- ");         // This method will remove any duplicate LL nodes (that is, with the same color)         head = removeDuplicates( head );         showLL( head );       }        **public static Node removeDuplicates(Node head) {           return head;     }      ** private static void showLL(Node head) {          // ToDo: Output the entire linked list     }       private static Node buildLL() {         // Use this code to create your LL         Node head = new Node("Red", null);           Node n2 = new Node("Blue", null);         head.next = n2;           Node n3 = new Node("Green", null);         n2.next = n3;           Node n4 = new Node("Yellow", null);         n3.next = n4;           Node n5 = new…

Java Algorithm Programming Question Implement the ADT queue by using a circular linked list. Recall that this list has only an external reference to its last note. Example Output: Create a queue: isEmpty () returns true Add to queue to get Joe Jess Jim Jill Jane Jerry isEmpty () returns false Testing getFront and dequeue: Joe is at the front of the queue. Joe is removed from the front of the queue. Jess is at the front of the queue. Jess is removed from the front of the queue. Jim is at the front of the queue. Jim is removed from the front of the queue. Jill is at the front of the queue. Jill is removed from the front of the queue. Jane is at the front of the queue. Jane is removed from the front of the queue. Jerry is at the front of the queue. Jerry is removed from the front of the queue. The queue should be empty: isEmpty() returns true Add to queue to get Joe Jess Jim Testing clear: isEmpty() returns true Add to queue to get Joe Jess Jim Joe is at the front of the queue. Joe is…

Write a recursive instance method isSorted that takes a Link parameter and determines whether a linked list is sorted in descending order or not (return a boolean value).