Write an efficient java code (not insert method) to insert x in a binary search tree (BST) with root t. Please write proper comments in your java code. Your java code should not read or print anything. Assume BST node is defined as follow:               private class node{ int  data; node ll, rl; // left and right link  // node constructor node(int k) {          data=k; ll=rl=null; } // end constructor } // end class node I have written the first line of code: node tmp = new node(x);   // Allocating space for a new node with x.

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)

Consider the following structure of a node for a linked list. struct Node { int key; Node *next; }; What will be the output of the following pseudo-code? Assume, head is a pointer to the first node of the following linked list. 5->2->8->2->9->2->11-> NULL Node *pres head; 0; while(pres!= NULL && Count key : int count 2) { count = count + 1; } pres = pres->next; } cout key « endl; 11 Error 2.

Given Class:- import java.util.*; // Iterator, Comparatorpublic class BinarySearchTree<T> implements BSTInterface<T>{protected BSTNode<T> root; // reference to the root of this BSTprotected Comparator<T> comp; // used for all comparisonsprotected boolean found; // used by removepublic BinarySearchTree() // Precondition: T implements Comparable// Creates an empty BST object - uses the natural order of elements.{root = null;comp = new Comparator<T>(){public int compare(T element1, T element2){return ((Comparable)element1).compareTo(element2);}};}public BinarySearchTree(Comparator<T> comp) // Creates an empty BST object - uses Comparator comp for order// of elements.{root = null;this.comp = comp;}public boolean isFull()// Returns false; this link-based BST is never full.{return false;}public boolean isEmpty()// Returns true if this BST is empty; otherwise, returns false.{return (root == null);}public T min()// If this BST is empty, returns null;//…

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:

Implement a __setitem__ function that also supports negative indices. For example: W = L2(Node(10, Node(20, Node(30))))print W[ 10, 20, 30 ] W[1]=25print W[ 10, 25, 30 ] W[-1]=35print W[ 10, 25, 35 ] Complete the code: def L2(*args,**kwargs):         class L2_class(L):                 def __getitem__(self, idx):                         <... YOUR CODE HERE ...>                 def __setitem__(self, idx, value):            <... YOUR CODE HERE ...>                 return L2_class(*args,**kwargs) W = L2(Node(10, Node(20, Node(30))))print(W)W[1]=25print(W)W[-1]=35print(W)

Please fill in the code gaps if possible. This problem has been giving me trouble. Any help is appreciated.  public class Node {       private String element; // we assume elements are character strings         private Node next;  /* Creates a node with the given element and next node. */ public Node(String s, Node n) {  //fill in body  }  /* Returns the element of this node. */ public String getElement() {  //fill in body  }  /* Returns the next node of this node. */ public Node getNext() {  //fill in body  }  // Modifier methods:  /* Sets the element of this node. */ public void setElement(String newElem) {  //fill in body  }  /* Sets the next node of this node. */ public void setNext(Node newNext) {  //fill in body  } }

I want convert the code from  singly-linked list to doubly-linked list        package Problem; class Node{        private Object value;     // Holds the data of the node        private Node next;        // Holds the follwoing node's address          Node(Object v, Node n){              this.value =v;              this.next = n;        }          public Node getNext(){              return this.next;        }          public Object getValue(){              return this.value;        }          public void setNext(Node n){              this.next=n;        }          public void setValue(Object v)        {              this.value=v;        } }   class SLL{        public Node head;        SLL(){              this.head=null;        }          public  void display(){              Node curr = this.head;              while(curr != null)              {                     System.out.print(curr.getValue());                     if(curr.getNext()!=null)…

Can you help me with a C++ programming task I am trying to complete for myself please: Write a program (in main.cpp) that: Prompts the user for a filename containing node data. Outputs the minimal spanning tree for a given graph. You will need to implement the createSpanningGraph method in minimalSpanTreeType.h to create the graph and the weight matrix. There are a few tabs: main.cpp, graphType.h, linkedList.h, linkedQueue.h, queueADT.h, minimalSpanTreeType.h, and then two data files labeled: CH20_Ex21Data.txt, CH20Ex4Data.txt

I want convert the code from  singly-linked list to doubly-linked list        package Problem; class Node{        private Object value;     // Holds the data of the node        private Node next;        // Holds the follwoing node's address          Node(Object v, Node n){              this.value =v;              this.next = n;        }          public Node getNext(){              return this.next;        }          public Object getValue(){              return this.value;        }          public void setNext(Node n){              this.next=n;        }          public void setValue(Object v)        {              this.value=v;        } }   class SLL{        public Node head;        SLL(){              this.head=null;        }          public  void display(){              Node curr = this.head;              while(curr != null)              {                     System.out.print(curr.getValue());                     if(curr.getNext()!=null)…