Problem 02:

Consider the following java class:

public class Node{

int data;

Node next;

}

Write a java method DeleteMax (which has access to a linked lists head) that deletes and returns the maximum integer in the list. You can assume that each number in the list is unique.

public static Node aList;//A reference to the linked lists head

public static int DeleteMax () {. your code.}

You code complexity should not be worse than O(n) where n is the number of nodes in the list.

You need to submit the following files.

Node.java //the Node class

TestList.java //should have the main method which calls the DeleteMax method

It is important to preserve the order of numbers in the list when deleting.