The code of the class Linkedlist is provided. Test your method from the main. Constraints. For full credit, your solution must meet the following restrictions. A violating solution will be penalized accordingly. points if violated. Your code must run in no worse than O(n), where n is the length of the linked list. B)ts if violated. Do not leak memory Problem. In an unsorted linked list, delete duplicate nodes by traversingthe list only once.Add a method removeDuplicates() to the class LinkedList, see the nextpage. The code of the class LinkedList is provided.Test your method from the main.Constraints. For full credit, your solution must meet the followingrestrictions. A violating solution will be penalized accordingly.A) -20 points if violated. Your code must run in no worse than 0(n), wheren is the length of the linked list.B) -30 points if violated. Do not leak memory; if you remove nodes fromthe list, free their associated memory.C) -10 points if violated. Your code must solve the problem by making onlya single traversal over the list, not multiple passes.Suggested realization of the LinkedList class.public class LinkedList {private Nodehead;private class Node { private intvalue; private Nodenext;public Node(int value) { this.value = value;www w}}@Overridepublic String toString() {Node current = head; StringBuffer toPrint = new StringBuffer(); toPrint.append("[");while (current != null) { if (current.next != null) {toPrint.append(current.value + ", ");} else {ww. wwtoPrint.append(current.value);} current = current.next;w w w m}toPrint.append("]"); returntoPrint.toString();}public void addFirst(int value) { Node node =new Node(value);if (head == null) { head =node;} else {node.next = head; head= node;}}

Answered: code of the class Linkedlist is…

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

The code of the class Linkedlist is provided. Test your method from the main. Constraints. For full credit, your solution must meet the following restrictions. A violating solution will be penalized accordingly. points if violated. Your code must run in no worse than O(n), where n is the length of the linked list. B)ts if violated. Do not leak memory