1. Define the method remove, as described in Exercise 3 of the previous chapter, for the class LList.
2. Repeat the previous exercise, but remove all occurrences of an Object from the list.
3. Define the method moveToEnd, as described in Exercise 4 of the previous chapter, for the class LList.
4. Implement a replace method for the class LList that returns a boolean value.
5. Suppose that a list contains Comparable objects. Define the methods getMin and remove in, as described in Exercise 7 of the previous chapter, for the class LList.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here