Question

Linked List - Delete Modify Lab 5 and include the method to delete a node from the Linked List. In summary: 1) Add the method Delete 2) Method call to delete, with a number that IS in the list 3) Method call to delete, with a number that is NOT in the list - Be sure to include comments - Use meaningful identifier names (constants where appropriate)

BELOW IS THE CODE I ALREADY HAVE

Answer 1

package DS;

public class MyLinkedList

{

// Head of list

Node head;

// Linked list node

// This inner class is made static

// so that main can access it

static class Node

{

int data;

Node next;

// Constructor

Node(int d)

{

data = d;

next = null;

}

}

// Method to insert a new node

public static MyLinkedList insert(MyLinkedList list, int data)

{

// Create a new node with given data

Node new_node = new Node(data);

new_node.next = null;

// If the Linked list is empty,

// then make the new node as head

if(list.head == null)

list.head = new_node;

else

{

// Else traverse till the last node

// and insert the new_node there

Node last = list.head;

while(last.next != null)

last = last.next;

last.next = new_node;

}

// Returns the list by head

return list;

}

// Method to print linked list

public static void printList(MyLinkedList list)

{

Node currNode = list.head;

System.out.print("\nLinkedList: ");

// Traverse through the LinkedList

while(currNode != null)

{

// Print the data at current node

System.out.print(currNode.data + " ");

// Go to next node

currNode = currNode.next;

}

}

public static MyLinkedList delete(MyLinkedList list, int data)

{

// Store head node

Node currNode = list.head;

Node prevNode = list.head;

  

// If head node itself holds the key to be deleted

if (currNode != null && currNode.data == data)

{

list.head = currNode.next; // Changed head

System.out.println("\nDeleted node " + data + " in the LinkedList.");

return list;

}

  

// Search for the key to be deleted, keep track of the

// previous node as we need to change currNode.next

while (currNode != null && currNode.data != data)

{

prevNode = currNode;

currNode = currNode.next;

}

  

// If key was not present in linked list

if (currNode == null)

{

System.out.println("\n" + data + " not available in the LinkedList.");

return list;

}

  

// Unlink the node from linked list

prevNode.next = currNode.next;

System.out.println("\nDeleted node " + data + " in the LinkedList.");

return list;

}

// Driver code

public static void main(String ss[])

{

// Starts with the empty list

MyLinkedList list = new MyLinkedList();

/************* Insertion ************/

// insert the values

list = insert(list, 1);

list = insert(list, 2);

list = insert(list, 3);

list = insert(list, 4);

list = insert(list, 5);

list = insert(list, 6);

list = insert(list, 7);

list = insert(list, 8);

// Print the LinkedList

printList(list);

// Call the method to delete data 2

list = delete(list, 2);

printList(list);

// Call the method to delete data 12

list = delete(list, 12);

printList(list);

}// End of main method

}// End of class

Sample Output:

LinkedList: 1 2 3 4 5 6 7 8
Deleted node 2 in the LinkedList.

LinkedList: 1 3 4 5 6 7 8
12 not available in the LinkedList.

LinkedList: 1 3 4 5 6 7 8