LinkedListOperations.java:- class Node { public int item; public Node next; public Node(int val) { item = val; } public void displayNode() { System.out.println(\"[\" + item + \"] \"); } } class LinkedList { private Node first; public LinkedList() { first = null; } public boolean isEmpty() { return (first==null); } public void insert(int val)//inserts at beginning of list { Node newNode = new Node(val); newNode.next = first; first = newNode; } public Node delete()//deletes at beginning of list { Node temp = first; first = first.next; return temp; } public void display() { System.out.println(\"List items from first to last :\"); Node current = first; while(current != null) { current.displayNode(); current = current.next; } System.out.println(\"\"); } public Node search(int val) { Node current = first; while(current.item != val) { if(current.next == null) return null; else current = current.next; } return current; } public Node delete(int val) { Node current = first; Node previous = first; while(current.item != val) { if(current.next == null) return null; else { previous = current; current = current.next; } } if(current == first) first = first.next; else previous.next = current.next; return current; } } class LinkedListOperations { public static void main(String[] args) { LinkedList object = new LinkedList(); object.insert(10); object.insert(20); object.insert(30); object.display(); while( !object.isEmpty() ) { Node member = object.delete(); System.out.print(\"Deleted \"); member.displayNode(); System.out.println(\"\"); } object.display(); object.insert(40); object.insert(50); object.insert(60); object.display(); Node objecttosearch = object.search(50); if( objecttosearch != null) System.out.println(\"Found Node : \" + objecttosearch.item); else System.out.println(\"Cannot locate the node\"); Node objecttodelete = object.delete(50); if( objecttodelete != null ) System.out.println(\"Deleted node : \" + objecttodelete.item); else System.out.println(\"Cannot delete the node\"); object.display(); } } Solution LinkedListOperations.java:- class Node { public int item; public Node next; public Node(int val) { item = val; } public void displayNode() { System.out.println(\"[\" + item + \"] \"); } } class LinkedList { private Node first; public LinkedList() { first = null; } public boolean isEmpty() { return (first==null); } public void insert(int val)//inserts at beginning of list { Node newNode = new Node(val); newNode.next = first; first = newNode; } public Node delete()//deletes at beginning of list { Node temp = first; first = first.next; return temp; } public void display() { System.out.println(\"List items from first to last :\"); Node current = first; while(current != null) { current.displayNode(); current = current.next; } System.out.println(\"\"); } public Node search(int val) { Node current = first; while(current.item != val) { if(current.next == null) return null; else current = current.next; } return current; } public Node delete(int val) { N.

1. LinkedListOperations.java:-
class Node
{
public int item;
public Node next;
public Node(int val)
{
item = val;
}
public void displayNode()
{
System.out.println("[" + item + "] ");
}
}
class LinkedList
{
private Node first;
public LinkedList()
{
first = null;
}
public boolean isEmpty()
{
return (first==null);
}
public void insert(int val)//inserts at beginning of list
{
Node newNode = new Node(val);
newNode.next = first;
first = newNode;
}
public Node delete()//deletes at beginning of list
{
Node temp = first;
first = first.next;

2. return temp;
}
public void display()
{
System.out.println("List items from first to last :");
Node current = first;
while(current != null)
{
current.displayNode();
current = current.next;
}
System.out.println("");
}
public Node search(int val)
{
Node current = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
current = current.next;
}
return current;
}
public Node delete(int val)
{
Node current = first;
Node previous = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
{
previous = current;

3. current = current.next;
}
}
if(current == first)
first = first.next;
else
previous.next = current.next;
return current;
}
}
class LinkedListOperations
{
public static void main(String[] args)
{
LinkedList object = new LinkedList();
object.insert(10);
object.insert(20);
object.insert(30);
object.display();
while( !object.isEmpty() )
{
Node member = object.delete();
System.out.print("Deleted ");
member.displayNode();
System.out.println("");
}
object.display();
object.insert(40);
object.insert(50);
object.insert(60);
object.display();
Node objecttosearch = object.search(50);
if( objecttosearch != null)

4. System.out.println("Found Node : " + objecttosearch.item);
else
System.out.println("Cannot locate the node");
Node objecttodelete = object.delete(50);
if( objecttodelete != null )
System.out.println("Deleted node : " + objecttodelete.item);
else
System.out.println("Cannot delete the node");
object.display();
}
}
Solution
LinkedListOperations.java:-
class Node
{
public int item;
public Node next;
public Node(int val)
{
item = val;
}
public void displayNode()
{
System.out.println("[" + item + "] ");
}
}
class LinkedList
{
private Node first;
public LinkedList()
{
first = null;
}

5. public boolean isEmpty()
{
return (first==null);
}
public void insert(int val)//inserts at beginning of list
{
Node newNode = new Node(val);
newNode.next = first;
first = newNode;
}
public Node delete()//deletes at beginning of list
{
Node temp = first;
first = first.next;
return temp;
}
public void display()
{
System.out.println("List items from first to last :");
Node current = first;
while(current != null)
{
current.displayNode();
current = current.next;
}
System.out.println("");
}
public Node search(int val)
{
Node current = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
current = current.next;

6. }
return current;
}
public Node delete(int val)
{
Node current = first;
Node previous = first;
while(current.item != val)
{
if(current.next == null)
return null;
else
{
previous = current;
current = current.next;
}
}
if(current == first)
first = first.next;
else
previous.next = current.next;
return current;
}
}
class LinkedListOperations
{
public static void main(String[] args)
{
LinkedList object = new LinkedList();
object.insert(10);
object.insert(20);
object.insert(30);
object.display();
while( !object.isEmpty() )

7. {
Node member = object.delete();
System.out.print("Deleted ");
member.displayNode();
System.out.println("");
}
object.display();
object.insert(40);
object.insert(50);
object.insert(60);
object.display();
Node objecttosearch = object.search(50);
if( objecttosearch != null)
System.out.println("Found Node : " + objecttosearch.item);
else
System.out.println("Cannot locate the node");
Node objecttodelete = object.delete(50);
if( objecttodelete != null )
System.out.println("Deleted node : " + objecttodelete.item);
else
System.out.println("Cannot delete the node");
object.display();
}
}