Write a code that will print the deleted number class LinkedList { static Node head; static class Node { int data; Node next; Node(int d) { data = d; next = null; } } void duplicateremove() { Node ptr1 = null, ptr2 = null, dup = null; ptr1 = head; while (ptr1 != null && ptr1.next != null) { ptr2 = ptr1; while (ptr2.next != null) { if (ptr1.data == ptr2.next.data) { ptr2.next = ptr2.next.next; System.gc(); } else { ptr2 = ptr2.next; } } ptr1 = ptr1.next; } } void printList(Node node) { while (node != null) { System.out.print(node.data + " "); node = node.next; } } public static void main(String[] args) { LinkedList list = new LinkedList(); list.head = new Node(3); list.head.next = new Node(3); list.head.next.next = new Node(5); list.head.next.next.next = new Node(6); System.out.println( "before removing duplicates : \n "); list.printList(head); list.duplicateremove(); System.out.println(""); System.out.println( "after removing duplicates : \n "); list.printList(head); } }

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Write a code that will print the deleted number

class LinkedList {

static Node head;

static class Node {

int data;
Node next;

Node(int d)
{
data = d;
next = null;
}
}

void duplicateremove()
{
Node ptr1 = null, ptr2 = null, dup = null;
ptr1 = head;

while (ptr1 != null && ptr1.next != null) {
ptr2 = ptr1;

while (ptr2.next != null) {

if (ptr1.data == ptr2.next.data) {

ptr2.next = ptr2.next.next;
System.gc();
}
else {
ptr2 = ptr2.next;
}
}
ptr1 = ptr1.next;
}
}

void printList(Node node)
{
while (node != null) {
System.out.print(node.data + " ");
node = node.next;
}
}

public static void main(String[] args)
{
LinkedList list = new LinkedList();
list.head = new Node(3);
list.head.next = new Node(3);
list.head.next.next = new Node(5);
list.head.next.next.next = new Node(6);

System.out.println(
"before removing duplicates : \n ");
list.printList(head);

list.duplicateremove();
System.out.println("");
System.out.println(
"after removing duplicates : \n ");
list.printList(head);
}
}