gistfile1.cpp

/* ----------        ----------
*  - Data   -        - Data   -
*  ----------        ----------
*  - Pointer- - - -> - Pointer-
   ----------        ----------   */

#include <iostream>

struct node {
  int data;
  node *next;
};


static node * traverse(node *root, node *traversal) 
{

  if (traversal != NULL) {    //ensures something to begin with
    while ( traversal->next != NULL ) { //goes on until it does find a null 
      std::cout << traversal->data << "\n";
      traversal = traversal->next;
    }
    std::cout << traversal->data << "\n";
  }

  return traversal;
}

void insert(node *traversal) 
{
  int x = 1;
  while(x <= 20) {

    traversal->next = new node; //create new node at the end of the list
    traversal = traversal->next; //points to that node
    traversal->next = NULL; //stops from going any further
    traversal->data = x;

    x++;
  }
}

int main()
{
  node *root;      // This will be the unchanging first node
  								 // Think of like a train engine

  root = new node; // Now root points to a node struct/class
  root->next = NULL;  // The node root points to has its next pointer
                      //  set equal to a null pointer
  root->data = 0;     // By using the -> operator, you can modify the node
                      //  a pointer (root in this case) points to.


  node *traversal; // Will point to the node as it traverses the list. 
                   //think of this like the conductor of a train

  traversal = root; //set the traversal 

  insert(traversal);
  traverse(root, traversal);
  

}