Linked List, create your own code. (Do not use the build in function or classes of Java or from the textbook). Create a LinkedList class: Call the class MyLinkedList, (hint) Create a second class called Node.java and use it, remember in the class I put the Node class inside the LinkedList Class, but you should do it outside. This class should haveo Variables you may need for a Node,o (optional) Constructor Your linked list is of an int type. (you may do it as General type as <E>) For this Linked List you need to have the following methods:add, addAfter, remove, size, contain, toString, compare, addInOrder.This is just a suggestion, if you use Generic type, you must modify this Write a main function or Main class to test all the methods,o Create a 2 linked list and test all your methods. (Including the compare) Name ofthe methodConstructoraddaddAfterremovesizecontaintoStringcomparePossible* signature of the methodpublic void add(int element)public void addAfter(int element, intafterint)public void remove(int value)public int size()public boolean contains(int value)public String toString()public boolean compare(MyLinkedListotherList)addinOrder public void addinOrder (int element)ExplanationOptionalAdd the elements to the head of the LinkedList.This function add value after a specificvalue(int), if the value does not exist, thenadd it to the tail. If there are multiplevalues of specific value, add it after thevery first oneGiven a value in int, if the Linked List has it,delete it (if the linked list has multipleplaces the same value, only the firstoccurrence needs to be deleted)returns the size of the linked list, if empty,return 0Check if a Linked List has a value if it does,return true, else False.ToString method will override ToStringmethod to return string containing theLinked List elements (ready to be printed)compare two linked list to check if theyhave the same value.This function will add the given elements inorder, as you add, it will after largest valuethat is smaller than our element.If the Linked List is empty, or the elementwe want to add is smallest, add to head,If the value is largest, add to the tail.ExampleWe have a linked List:1->2->4->5->4->3,call addAfter(9, 4) should add9 after 4, so the Linked Listwill look like:1->2->4->9->5->4->31->2->3->1->3 and we try todelete 3 we should get 1->2->1->3In the following linked list:1->3->6->8,contain(2) should returnFalse and contain(8) shouldreturn trueEx: A=1->2->3, B=1->3->2return falseEx: A=1->2->3, B=1->2->3return trueGiven: 1->5->12->20If we try to add 6, it shouldadd It1->5->6->12->20

The code ,output and explanation is given below

Answered: Linked List, create your own code. (Do…

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

Linked List, create your own code. (Do not use the build in function or classes of Java or from the textbook).
Create a LinkedList class: Call the class MyLinkedList,
(hint) Create a second class called Node.java and use it, remember in the class I put the Node class inside the LinkedList Class, but you should do it outside. This class should have
o Variables you may need for a Node,
o (optional) Constructor
Your linked list is of an int type. (you may do it as General type as <E>)
For this Linked List you need to have the following methods:

add, addAfter, remove, size, contain, toString, compare, addInOrder.

This is just a suggestion, if you use Generic type, you must modify this
 Write a main function or Main class to test all the methods,
o Create a 2 linked list and test all your methods. (Including the compare)