Given the IntNode class, define the findMax() method in the Custom Linked List class that returns the largest value in the list or returns -99 if the list is empty. Assume all values in the list are non-negative. Ex: If the list contains: head -> 14 -> 191 -> 186 -> 181 findMax(headObj) returns 191. Ex: If the list contains: head -> findMax(headObj) returns -99.

class BSTNode  {      int key;      BSTNode left, right;        public BSTNode(int item) {            key = item;            left = right = null;      } }     class BST_Tree  {            BSTNode root;        BST_Tree()  {   // Constructor            root = null;      }       boolean search(int key){         return (searchRec(root, key) != null);     }          public BSTNode searchRec(BSTNode root, int key) {          if (root==null || root.key==key)            return root;              if (root.key > key)            return searchRec(root.left, key);              return searchRec (root.right, key);     }              void deleteKey(int key) {            root = deleteRec(root, key);      }      /* A recursive function to insert a new key in BST */      BSTNode deleteRec(BSTNode root, int key) {            /* Base Case: If the tree is empty */            if (root == null) return root;              /* Otherwise, recur down the tree */            if (key < root.key)…

Redesign LaptopList class from previous project public class LaptopList {       private class LaptopNode  //inner class     {         public String brand;         public double price;         public LaptopNode next;           public LaptopNode(String brand, double price)         {                // add your code         }         public String toString()         {             // add your code         }     }       private LaptopNode head; // head of the linked list       public LaptopList(String fname) throws IOException     {         File file = new File(fname);         Scanner scan = new Scanner(file);         head = null;         while(scan.hasNextLine())         {             // scan data             // create LaptopNode             // call addToHead and addToTail alternatively          }     }       private void addToHead(LaptopNode node)     {             // add your code     }       private void addToTail(LaptopNode node)     {             // add your code     }       private…

PLEASE HELP, PYTHON THANK YOU def add_vertex(self, vertex):        if vertex not in self.__graph_dict:            self.__graph_dict[vertex] = []    def add_edge(self, edge):        edge = set(edge)        (vertex1, vertex2) = tuple(edge)        #################        # Problem 4:        # Check to see if vertex1 is in the current graph dictionary        ##################        #DELETE AND PUT IN THE IF STATEMENTS            self.__graph_dict[vertex1].append(vertex2)        else:            self.__graph_dict[vertex1] = [vertex2]    def __generate_edges(self):        edges = []        #################        # Problem 5:        # Loop through all of the data in the graph dictionary and use the variable vertex for the loop'ed data        ##################        #DELETE AND PUT IN THE LOOP STATEMENTS            for neighbour in self.__graph_dict[vertex]:                if {neighbour, vertex} not in edges:                    edges.append({vertex, neighbour})        return edges…

class BSTNode  {      int key;      BSTNode left, right;        public BSTNode(int item) {            key = item;            left = right = null;      } }     class BST_Tree  {            BSTNode root;        BST_Tree()  {   // Constructor            root = null;      }       boolean search(int key){         return (searchRec(root, key) != null);     }          public BSTNode searchRec(BSTNode root, int key) {          if (root==null || root.key==key)            return root;              if (root.key > key)            return searchRec(root.left, key);              return searchRec (root.right, key);     }              void deleteKey(int key) {            root = deleteRec(root, key);      }      /* A recursive function to insert a new key in BST */      BSTNode deleteRec(BSTNode root, int key) {            /* Base Case: If the tree is empty */            if (root == null) return root;              /* Otherwise, recur down the tree */            if (key < root.key)…

A summer camp ofes a moming sesnandan atemon sesin The is momiglist otis he names ofal chidenatedingthe moming sesin and he is tenonlistontinsthe names ofal chide aterdn the atemon sesin. atending boh esins is ound in istnd etums fale chewise. FOR EACH child IN norninglist (MISSING CODE> IF (1SFound (afternoonlList, child) APPEND (lunchList, child)

Please fill in all the code gaps if possible: (java) public class LinkedList {     privateLinkedListNode head; **Creates a new instance of LinkedList** public LinkedList () { } public LinkedListNode getHead() public void setHead (LinkedListNode head) **Add item at the front of the linked list** public void insertFront (Object item) **Remove item at the front of linked list and return the object variable** public Object removeFront() }