Please make a linked list box and arrow diagrams to explain how the addNode(DLLNode newNode) and toString() methods in the DLList.java classwork.
public class DLList {
public DLLNode front;
public DLLNode back;
public DLList(String name) {
this.front = new DLLNode();
this.front.name = name;
this.front.nextnode = null;
this.front.prevnode = null;
this.back = front;
}
public void addNode(DLLNode
newNode) {
newNode.nextnode =
this.front;
this.front.prevnode =
newNode;
this.front = newNode;
}
public void reverseListv1() {
DLLNode current = this.back; //set iterator to the back node
DLLNode prevBuffer = this.back.nextnode; //record (old) nextnode
DLLNode prev;
this.front = this.back; //
set the list's "back" as the "front"
while (current != null) {
current.nextnode =
current.prevnode; // set current node's nextnode as its previous
prev = current; //record last
node processed
current = current.prevnode;
//move iterator
prev.prevnode = prevBuffer; //set
last processed node's prevnode to its (old) nextnode
prevBuffer = current;
//record last processed node's (old) nextnode
this.back = prev; // set the
list's "back" point to the last processed node
}
}
String firstName =
front.name;
//System.out.println(firstName);
DLList reversedList = new
DLList(firstName);
//System.out.println(reversedList.toString());
DLLNode frontCursor = new
DLLNode();
frontCursor = this.front;
while(frontCursor.nextnode !=
null) {
frontCursor =
frontCursor.nextnode;
String currName =
frontCursor.name;
DLLNode currNode = new
DLLNode(currName);
reversedList.addNode(currNode);
}
this.front =
reversedList.front;
}
public String toString(){
String toReturn =
"front-->";
DLLNode currentF =
this.front;
while(currentF!= null) {
toReturn = toReturn +
currentF.nodeString() + "-->" ;
currentF = currentF.nextnode;
}
toReturn = toReturn +
"back";
return toReturn;
}
String toReturn =
"";
return toReturn;
}
}
Please make a linked list box and arrow diagrams to explain how the addNode(DLLNode newNode) and toString() methods in the DLList.java classwork.
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
