java/13-linkedlists/MonkeyAddEnd Source

Viewing java/13-linkedlists/MonkeyAddEnd by daveagp@gmail.com. You have unsaved changes. Log in above to create, edit, preview and publish Websheets.

Property Value

Description
html markup
shown to student

Create a method <tt>addEnd(String newName)</tt>
that adds a new Node, containing this name,
at the <b>end</b> of the list.

Epilogue
html markup
shown when solved

remove
Public permissions remove
Remarks
Comments, history, license, etc.

remove
Engine
Choices
json list of string, bool pairs
e.g. [["good", true], ["bad", false]]

Correct answer
Template / Reference solution

// structure of items in list
private class Node {
// each node knows "next" node
Node next;
// and stores a value
String name;
// constructor for nodes
Node(String initialName) {
name = initialName;
}
}

// beginning of the list, initially empty
private Node first = null;

// a demo to create a length-3 list
public void threeKongs() {
first = new Node("DK Sr.");
first.next = new Node("DK");
first.next.next = new Node("DK Jr.");
}

// a working copy of this method from MonkeyTraverse will be included
// it prints all Strings in the linked list, from first to last
public void printAll() // ... method body not shown
\hide[
{
Node current = first; // start at beginning

// if current isn't past the last node,
while (current != null) {
// println current node's name; then repeat loop w/next one
System.out.println(current.name);
current = current.next;
}
}
]\

// add a new node, containing this name, at the end of the list
public void addEnd(String newName) {
Node newLast = new Node(newName);

// loop like printAll(), but stop *just before* the end.
// then, add the new node
\[
if (first == null) {
first = newLast;
}
else {
Node current = first;
while (current.next != null) {
current = current.next;
}
current.next = newLast;
}
]\
}

public static void main(String[] args) {
MonkeyChain mc = new MonkeyChain();
mc.threeKongs();
mc.addEnd("Bubbles");
mc.printAll();
}

Template / Reference solution

Java test suite
See manual

testMain();
saveAs = "mc";
testConstructor();
remark("Checking if special case of adding to empty list is handled correctly…");
testOn("mc", "addEnd", "Curious George");
testOn("mc", "addEnd", "Bubbles");
testOn("mc", "printAll");

C++ test suite
json list of stdin/args tests
e.g. [{"stdin":"hi", "args":["4", "5"]}, {"stdin":"noargs"}]
to just run once with no input use [{}]

C++ test suite
See manual

Forbidden substrings
json list of strings
e.g. ["for","while"]

remove
Solution visibility remove
Java imports
json list of importables
e.g. ["java.util.*"]

remove
Override Java classname
else defaults to
websheet name
remove
Dependent on other websheets?
json list of websheet names in this folder
e.g. ["DataStructure"]

remove
Is example?
i.e., just a demo
remove
Add compiler flag(s)
json list of flags
e.g. ["-Wno-unused-variable"]

remove
Remove default compiler flag(s)
json list of flags
see default_cppflags
e.g. ["-Wno-write-strings"]

remove

Property	Value
Description html markup shown to student	Create a method <tt>addEnd(String newName)</tt> that adds a new Node, containing this name, at the <b>end</b> of the list.
Epilogue html markup shown when solved	remove
Public permissions	remove
Remarks Comments, history, license, etc.	remove
Engine
Choices json list of string, bool pairs e.g. `[["good", true], ["bad", false]]`
Correct answer
Template / Reference solution	// structure of items in list private class Node { // each node knows "next" node Node next; // and stores a value String name; // constructor for nodes Node(String initialName) { name = initialName; } } // beginning of the list, initially empty private Node first = null; // a demo to create a length-3 list public void threeKongs() { first = new Node("DK Sr."); first.next = new Node("DK"); first.next.next = new Node("DK Jr."); } // a working copy of this method from MonkeyTraverse will be included // it prints all Strings in the linked list, from first to last public void printAll() // ... method body not shown \hide[ { Node current = first; // start at beginning // if current isn't past the last node, while (current != null) { // println current node's name; then repeat loop w/next one System.out.println(current.name); current = current.next; } } ]\ // add a new node, containing this name, at the end of the list public void addEnd(String newName) { Node newLast = new Node(newName); // loop like printAll(), but stop just before the end. // then, add the new node \[ if (first == null) { first = newLast; } else { Node current = first; while (current.next != null) { current = current.next; } current.next = newLast; } ]\ } public static void main(String[] args) { MonkeyChain mc = new MonkeyChain(); mc.threeKongs(); mc.addEnd("Bubbles"); mc.printAll(); }
Template / Reference solution
Java test suite See manual	testMain(); saveAs = "mc"; testConstructor(); remark("Checking if special case of adding to empty list is handled correctly…"); testOn("mc", "addEnd", "Curious George"); testOn("mc", "addEnd", "Bubbles"); testOn("mc", "printAll");
C++ test suite json list of stdin/args tests e.g. `[{"stdin":"hi", "args":["4", "5"]}, {"stdin":"noargs"}]` to just run once with no input use `[{}]`
C++ test suite See manual
Forbidden substrings json list of strings e.g. `["for","while"]`	remove
Solution visibility	remove
Java imports json list of importables e.g. `["java.util.*"]`	remove
Override Java classname else defaults to websheet name	remove
Dependent on other websheets? json list of websheet names in this folder e.g. `["DataStructure"]`	remove
Is example? i.e., just a demo	remove
Add compiler flag(s) json list of flags e.g. `["-Wno-unused-variable"]`	remove
Remove default compiler flag(s) json list of flags see default_cppflags e.g. `["-Wno-write-strings"]`	remove

Optional properties:

Note: problems are open-source by default (see 'Public permissions'). Assumed license for open problems is Creative Commons 4.0 Attribution-ShareAlike unless specified in 'Remarks'.