The document describes a Java implementation of a sorted singly linked list called MySortedSingleList that uses a Node class to store data and references. The MySortedSingleList class contains methods to check if a value is contained, add a value while maintaining sort order, and remove a value from the linked list. It implements these methods by traversing the list using a cursor to check nodes for the desired value.

1. Java problem. The followingJavaimplementation of a classNodeis given:
private class Node { Node() {
this(null, null);
}
Node(Comparable d) { this(d, null);
}
Node(Comparable d, Node n) { data = d;
next = n;
}
Comparable data; Node next;
}
Assume that a singly linked list is implemented with a header node, but no tail node, and that it
maintains only a reference to the header node.
Using the classNodedescribed above, write aMySortedSingleListclass in Java includes methods
to:
boolean contains( Object x ) - test if a value x is contained in the linked list.
boolean add( Object x ) - add a value x if it is not already contained in the linked list.
boolean remove(Object x) - remove a value x if it is contained in the linked list.
maintaining the singly linked list in sorted order.
Solution
package mysortedsinglelist;
public class MySortedSingleList {
private Node head;
//test if a value x is contained in the linked list.
public boolean contains(Comparable x){
/*Node tmp = head;
while(tmp!=null)
{
if(tmp.data!=x){
tmp = tmp.next;
}
else{

2. return true;
}
}
return false; */
Node cursor = head;
while(cursor != null)
{
if(cursor.data.equals(x))
{
return true;
}
cursor = cursor.next;
}
return false;
}
public boolean add(Comparable x)
{
Node nd = new Node();
nd.data = x;
//System.out.println("Adding: "+x);
boolean flag = contains(x);
/* check if the list is empty*/
if(head == null){
//since there is only one element, head
head = nd;
return true;
}
if(flag==false)
{
head.next=nd;
return true;
}
else
{
return false;

3. }
}
public boolean remove(Comparable x)
{
boolean flag = contains(x);
if(flag)
{
if(head == null)
{
System.out.println("Underflow...");
return false;
}
Node tmp = head;
head = tmp.next;
if(head == null){
head.next = null;
}
System.out.println("Deleted: "+tmp.data);
return true;
}
return true;
}
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
MySortedSingleList sl = new MySortedSingleList();
sl.add(3);
boolean c1= sl.contains(32);
System.out.print(c1);
sl.add(54);
sl.remove(32);
}

4. }
class Node
{
Node()
{
this(null, null);
}
Node(Comparable d)
{
this(d, null);
}
Node(Comparable d, Node n)
{
data = d;
next = n;
}
Comparable data; Node next;
}