Write an efficient java method that computes and returns the height from node t in a btree of any degree. Please write proper comments. Your java code should not read or print anything.  Assume btree node is defined as follow:               private class node{ int count, data[];  node parent, link[]; } // end class node private int height(node t){

/** * 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…

*JAVA* complete method  Delete the largest valueremoveMax(); Delete the smallest valueremoveMin();   class BinarHeap<T> {     int root;    static int[] arr;    static int size;     public BinarHeap() {        arr = new int[50];        size = 0;    }     public void insert(int val) {        arr[++size] = val;        bubbleUP(size);    }     public void bubbleUP(int i) {         int parent = (i) / 2;        while (i > 1 && arr[parent] > arr[i]) {            int temp = arr[parent];            arr[parent] = arr[i];            arr[i] = temp;            i = parent;        }     }     public int retMin() {                return arr[1];    }     public void removeMin() {     }     public void removeMax() {     }     public void print() {         for (int i = 0; i <= size; i++) {            System.out.print( arr[i] + " ");         }     }} public class BinarH {     public static void main(String[] args) {         BinarHeap Heap1 = new BinarHeap();…

write this code below as algorithim to determine the leaf node reclusively ?  public static void printLeafNodes(TreeNode node) {        // base case        if (node == null) {            return;        }        if (node.left == null && node.right == null) {            System.out.printf("%d ", node.value);        }        printLeafNodes(node.left);        printLeafNodes(node.right);    }

8. Following is the node class: class node { int v node *next: public: node(int x) {v=x; next3D03;} friend class list: }3; Implement the sequential list class below: class list { // circular list class // head position node *head; public: bool empty() { return !head;} list() {head-0;} ~list(); void add(int x); int get(); // empty list judgment / constructor // destructor, to be implemented // add to tail, to be implemented // get from head, to be implemented }3B

Java Programing  Design class CarInLine, with the following specifications: The class has two instance variables: arrivalTime and DepartureTime, stored as integers. Define a constructor that accepts an integer as an argument representing the arrival time, in which you set the departure time to zero, marking the beginning of a simulation. Create an appropriate set and get methods for the two instance variables. Implement a method totalTime() that returns an integer value representing the time spent in the queue, as the difference between the departure time and the arrival time. Define ten queues, simulating the functionality of the process, increasing the number of cashiers from one, and collecting the average waiting time for each scenario.  Each simulation will work with the same number of cars, which is considered 100.     The maximum number of cashiers/toll booths is 10. Create the queue with link-based implementation. Create each queue with the corresponding number of cashiers,…

comptuer sciecne help