Course: Data Structure and AlgorithimsLanguage: JavaKindly make the program in 2 hours.Task is well explained. You have to make the proogram properly in Java:Restriction: Prototype cannot be change you have to make program by using given prototype.TAsk:Create a class Node having two data membersint data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to nullCreate class LinkList having one data members of type Node.Node headWrite the following function in the LinkList classpublicvoidinsertAtLast(int data);//this function add node at the end of the listpublicvoid insertAthead(int data);//this function add node at the head of the listpublicvoid deleteNode(int key);//this function find a node containing "key" and delete itpublicvoid printLinkList();//this function print all the values in the Linklistpublic LinkListmergeList(LinkList l1,LinkList l2);// this function take two linklist li and l2 and merge it in such a way that this list common element only one time and noncommon

import java.io.*; /* Main class of Linked list */public class LinkList { Node head; // head of…

Answered: Create a class Node having two data…

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...

Related questions

Question

Course: Data Structure and Algorithims

Language: Java

Kindly make the program in 2 hours.

Task is well explained.

You have to make the proogram properly in Java:

Restriction: Prototype cannot be change you have to make program by using given prototype.

TAsk:

Create a class Node having two data members

Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null

Create class LinkList having one data members of type Node.

Write the following function in the LinkList class

publicvoidinsertAtLast(int data);//this function add node at the end of the list
publicvoid insertAthead(int data);//this function add node at the head of the list
publicvoid deleteNode(int key);//this function find a node containing "key" and delete it
publicvoid printLinkList();//this function print all the values in the Linklist
public LinkListmergeList(LinkList l1,LinkList l2);// this function take two linklist li and l2 and merge it in such a way that this list common element only one time and noncommon