Not logged in. Log in with GitHub. About Websheets.

List of all available Websheets


Viewing cpp/linkedlists/monkey_traverse by redekopp@usc.edu. You have unsaved changes. Log in above to create, edit, preview and publish Websheets.
PropertyValue
Description
html markup
shown to student
 
Create a method <tt>printAll()</tt>
that prints out all names in the list, one per line.
Public permissions remove
Engine
Template / Reference solution
 
#include <iostream>
#include <string>
using namespace std;
// structure of items in list
struct Node {
   Node* next;  // each node knows "next" node
   string name; // and stores a value
   Node(string initialName);  // constructor for nodes
};
Node::Node(string initialName) {name = initialName; next = NULL;}
class MonkeyChain {
   public:
      MonkeyChain();
      void threeKongs();
      void printAll();
   private: 
      Node* head;
};
MonkeyChain::MonkeyChain() {head = NULL;}
// a demo to create a length-3 list
void MonkeyChain::threeKongs() {
   head = new Node("DK Sr.");
   head->next = new Node("DK");
   head->next->next = new Node("DK Jr.");
}
void MonkeyChain::printAll() {
   // one possible approach: use a while loop
   Node* current = head; // start at beginning
   // if current isn't past the last node,
   while (\[current != NULL]\) {
      // print current node's name; then repeat loop w/next one
\[
      cout << current->name << endl;
      current = current->next;
]\
   }
}
int main() {
   MonkeyChain mc;
   mc.threeKongs();
   mc.printAll(); cout << endl;
   // double-check
   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 [{}]
 
[
   {}
]
Solution visibility 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'.