// interface method ================================================== public Node get(int val) { /*See BST.java for method specification */ /* Hint: Make sure you return a Node, not an int */ /* Your code here */ return null; // Dummy return statement. Remove when you implement! } FILL OUT METHOD AND ALL DESCRIPTIONS AND INFORMATION IS IN PICTURES PROVIDED! IN JAVA LANGUAGE

VERY EASY RPN PROBLEM. read the directions please answer thank you public class Node <T>{     private T data;    private Node<T> next;        public Node(T data, Node<T> next)    {        this.data = data;        this.next = next;    }        public T getData()    {        return data;    }        public Node<T> getNext()    {        return next;    }    }   import java.util.Stack; public class StackArray<T> implements Stack<T> {    private T [] elements;    private int top;    private int size;        public StackArray (int size)    {        elements = (T[]) new Object[size];        top = -1;        this.size = size;    }        public boolean empty()    {        return top == -1;    }        public boolean full()    {        return top == size - 1;    }        public boolean push(T el)    {        if (full())            return false;        else        {            top++;            elements[top] = el;            return true;        }    }…

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