in java I need help with making a preorder traversal method in a binary search tree, It uses recursion and the code is down below  private void preorder(BSTNode current, ArrayList preorderKeys) {         if (current == null) {             return;         }         preorderKeys.add(current.getKey());         preorderKeys.add((E) current.getLeftChild());         preorderKeys.add((E) current.getRightChild());     }   its supposed to look something like this preorder(node):  if node is null: return  visit node  preorder(node.left)  preorder(node.right)

Create a class Stack. This stack will be implemented using the LinkedList class that has been provided. This stack will hold values of a generic type (<T>).   Your Stack should have the following public methods: public void push(int n) public T pop() public T peek() public T size() public boolean isEmpty()   public class LinkedList <T> { private Node head; private Node tail; private int size;   public LinkedList() { head = null; tail = null; size = 0; }   public void append(T data) { Node newNode = new Node(data); if (head == null) { head = newNode; } else { tail.next = newNode; } tail = newNode; size++; }   public void prepend(T data) { Node newNode = new Node(data); if (head == null) { head = newNode; tail = newNode; } else { newNode.next = head; head = newNode; } size++; }   public T getHead() { return head.data; }   public T getTail() { return tail.data; }   public int size() { return size; }   public void removeByValue(T data) { Node current = head; while…

In python. Write a LinkedList class that has recursive implementations of the add and remove methods. It should also have recursive implementations of the contains, insert, and reverse methods. The reverse method should not change the data value each node holds - it must rearrange the order of the nodes in the linked list (by changing the next value each node holds). It should have a recursive method named to_plain_list that takes no parameters (unless they have default arguments) and returns a regular Python list that has the same values (from the data attribute of the Node objects), in the same order, as the current state of the linked list. The head data member of the LinkedList class must be private and have a get method defined (named get_head). It should return the first Node in the list (not the value inside it). As in the iterative LinkedList in the exploration, the data members of the Node class don't have to be private. The reason for that is because Node is a trivial class…

Make this generic, instead of a Stack of Pancake. public class Stack {      private ArrayList<Pancake> plateful;   public Stack() {      plateful = null; }   public void push (Pancake p) {      Pancake newp = new Pancake (p);  // copy constructor plateful.add(newp); }   public Pancake pop (Pancake p) {      Pancake newp = plateful.get(plateful.size()-1); plateful.remove(plateful.size()-1); return newp; } }  // end of class definition

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 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:

24. Add the following new method in the BST class. /** Returns the number of nodes in this binary tree */ public int getNumberofNodes () Requirements: a. Don't use return size; b.write a recursive method that returns the number of nodes starting from www the root.

public class HeapPriQ<T> implements PriQueueInterface<T>{  protected ArrayList<T> elements;  // priority queue elements  protected int lastIndex;          // index of last element in priority queue  protected int maxIndex;           // index of last position in ArrayList   protected Comparator<T> comp;   public HeapPriQ(int maxSize)  // Precondition: T implements Comparable  {    elements = new ArrayList<T>(maxSize);    lastIndex = -1;    maxIndex = maxSize - 1;     comp = new Comparator<T>()    {       public int compare(T element1, T element2)       {         return ((Comparable)element1).compareTo(element2);       }    };  }   public HeapPriQ(int maxSize, Comparator<T> comp)  // Precondition: T implements Comparable  {    elements = new ArrayList<T>(maxSize);    lastIndex = -1;    maxIndex = maxSize - 1;     this.comp = comp;  }   public boolean isEmpty()  // Returns true if this priority queue is empty; otherwise, returns false.  {…

class IntBTNode {             private int data;             private IntBTNode left;             private IntBTNode right; } Write a new static method of the IntBTNode class to meet the following specification. Make the method as efficient as possible (do not visit nodes unnecessarily).   public static int max(BTNode root)      // Precondition: root is the root reference of a nonempty binary SEARCH     // tree.    // Postcondition: The return value is the largest value in the tree.

IN JAVA LANGUAGE ALL INFORMATION IN PICTURES FIND MIN OF A BST CALL ON A RECURSIVE FINDMIN_R THAT WILL RETURN THE SMALLEST ELEMENT IN A BST THANK YOU!!!!!!!!!!!