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; }
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 "sortLinkedList(<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 --> 20 --> 30 --> 40 --> 50](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9348d578-66ea-4064-b97e-301aeae52239%2F710ca467-25dc-4dd8-add5-4d1bbf2e590f%2Ftjei4ry_processed.jpeg&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 5 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)