Please solve the code using LLNode class package Linkedqueue;public class LLNode<T>{private LLNode<T> link;private T info;public LLNode(T info){this.info = info;link = null;}public void setInfo(T info)// Sets info of this LLNode.{this.info = info;}public T getInfo()// Returns info of this LLONode.{return info;}public void setLink(LLNode<T> link)// Sets link of this LLNode.{this.link = link;}public LLNode<T> getLink()// Returns link of this LLNode.{return link;}} Using only LLNode java class. Create a demo cass called LinkedListDemo.java. In this democlass, write a public static method called SumNode that receives a reference called list of typeLLNode of integer values. Your method should sum all the nodes content and then add a new nodecontains the summation to the end of the list.For example, if the list contains:list43628.Then after calling the method SumNode, the list becomes:list358736//-----Paste SumNode code below this line2.

as par your requirement with output Code in Java: sum will store at the end. class sumOfNode {…

Answered: Using only LLNode.java class. Create a…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Please solve the code using LLNode class

package Linkedqueue;

public class LLNode<T>
{
private LLNode<T> link;
private T info;

public LLNode(T info)
{
this.info = info;
link = null;
}

public void setInfo(T info)
// Sets info of this LLNode.
{
this.info = info;
}

public T getInfo()
// Returns info of this LLONode.
{
return info;
}

public void setLink(LLNode<T> link)
// Sets link of this LLNode.
{
this.link = link;
}

public LLNode<T> getLink()
// Returns link of this LLNode.
{
return link;
}

}