LLNode: public class LLNode { protected T info; protectedLLNodelink; public LLNode(Tinfo){ this.info=info; link=null; } publicvoidsetInfo(Tinfo){ this.info=info; } publicTgetInfo(){ return info; } publicvoidsetLink(LLNodelink){ this.link=link; } publicLLNodegetLink(){ return link; }   @Override public String toString(){ return "LLNode [info="+info+", link="+link+"]"; } } MyLLNode: public class MyLLNode { LLNodehead; public MyLLNode(){ this.head=null; }   public MyLLNode(String first){ this.head=newLLNode(first); } //------------------------------------------------------------- public void addAtEnd(String newstr){ LLNodenode=head; LLNodenewNode=newLLNode(newstr); if(this.head==null){ this.head=newNode; } else{ while(node.getLink()!=null){ node=node.getLink(); } node.setLink(newNode); } } //------------------------------------------------------------- public void addAtFront(String newstr){ LLNodenewNode=newLLNode(newstr); if(this.head==null){ this.head=newNode; } else{ newNode.setLink(this.head); this.head=newNode; } } //------------------------------------------------------------- public boolean contains(String item){ LLNodetemp=head; while(temp!=null){ if(temp.getInfo().equalsIgnoreCase(item)){ return true; } temp=temp.getLink(); } return false; } //------------------------------------------------------------- public String print(){ String result=""; LLNodetemp=head; while(temp!=null){ result+=temp.getInfo()+"-->"; temp=temp.getLink(); } return result; }

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
icon
Related questions
Question

LLNode:

public class LLNode<T> {

protected T info;

protectedLLNode<T>link;

public LLNode(Tinfo){

this.info=info;

link=null;

}

publicvoidsetInfo(Tinfo){

this.info=info;

}

publicTgetInfo(){

return info;

}

publicvoidsetLink(LLNode<T>link){

this.link=link;

}

publicLLNode<T>getLink(){

return link;

}

 

@Override

public String toString(){

return "LLNode [info="+info+", link="+link+"]";

}

}

MyLLNode:

public class MyLLNode {

LLNode<String>head;

public MyLLNode(){

this.head=null;

}

 

public MyLLNode(String first){

this.head=newLLNode<String>(first);

}

//-------------------------------------------------------------

public void addAtEnd(String newstr){

LLNode<String>node=head;

LLNode<String>newNode=newLLNode<String>(newstr);

if(this.head==null){

this.head=newNode;

}

else{

while(node.getLink()!=null){

node=node.getLink();

}

node.setLink(newNode);

}

}

//-------------------------------------------------------------

public void addAtFront(String newstr){

LLNode<String>newNode=newLLNode<String>(newstr);

if(this.head==null){

this.head=newNode;

}

else{

newNode.setLink(this.head);

this.head=newNode;

}

}

//-------------------------------------------------------------

public boolean contains(String item){

LLNode<String>temp=head;

while(temp!=null){

if(temp.getInfo().equalsIgnoreCase(item)){

return true;

}

temp=temp.getLink();

}

return false;

}

//-------------------------------------------------------------

public String print(){

String result="";

LLNode<String>temp=head;

while(temp!=null){

result+=temp.getInfo()+"-->";

temp=temp.getLink();

}

return result;

}

}

Given LLNode.java and MyLLNode.java. Create a new method called "sortLinked List(<any num of param of your
choice>)". This method will sort the LinkedList in ascending order.
Example#1
Before:
40-->20--10-->30-->50
After sortLinkedList() call:
10->20-->30-->40-->50
Example#2
Before:
50-->30-->40--10-->20--10-->30-->50-->20-->40
After cleanUpDuplicates() call:
10--10-->20-->20-->30-->30-->40-->40-->50-->50
Transcribed Image Text:Given LLNode.java and MyLLNode.java. Create a new method called "sortLinked List(<any num of param of your choice>)". This method will sort the LinkedList in ascending order. Example#1 Before: 40-->20--10-->30-->50 After sortLinkedList() call: 10->20-->30-->40-->50 Example#2 Before: 50-->30-->40--10-->20--10-->30-->50-->20-->40 After cleanUpDuplicates() call: 10--10-->20-->20-->30-->30-->40-->40-->50-->50
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 5 images

Blurred answer
Knowledge Booster
Unreferenced Objects
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education