Java Linked List Node Delete
Chapter:
Interview Programs
Last Updated:
17-11-2016 14:15:23 UTC
Program:
/* ............... START ............... */
public class JavaLinkedListNodeDeletion {
Node head;
class Node
{
int data;
Node next;
Node(int d)
{
data = d;
next = null;
}
}
void deleteNode(int key)
{
// Store head node
Node temp = head, prev = null;
// If head node itself holds the key to be deleted
if (temp != null && temp.data == key)
{
head = temp.next; // Changed head
return;
}
while (temp != null && temp.data != key)
{
prev = temp;
temp = temp.next;
}
if (temp == null) return;
// Unlink the node from linked list
prev.next = temp.next;
}
/* Inserts a new Node at front of the list. */
public void push(int new_data)
{
Node new_node = new Node(new_data);
new_node.next = head;
head = new_node;
}
/* This function prints contents of linked list starting from
the given node */
public void printList()
{
Node tnode = head;
while (tnode != null)
{
System.out.print(tnode.data+" ");
tnode = tnode.next;
}
}
/* Drier program to test above functions. Ideally this function
should be in a separate user class. It is kept here to keep
code compact */
public static void main(String[] args)
{
JavaLinkedListNodeDeletion llist = new JavaLinkedListNodeDeletion();
llist.push(7);
llist.push(1);
llist.push(3);
llist.push(2);
System.out.println("\nCreated Linked list is:");
llist.printList();
llist.deleteNode(1); // Delete node at position 4
System.out.println("\nLinked List after Deletion at position 4:");
llist.printList();
}
}
/* ............... END ............... */
Output
Created Linked list is:
2 3 1 7
Linked List after Deletion at position 4:
2 3 7
Notes:
-
To delete a node from linked list, we need to do following steps.
- 1) Find previous node of the node to be deleted.
- 2) Changed next of previous node.
- 3) Free memory for the node to be deleted.
Tags
Linked List Node Delete , Java, Interview Programs