~~NOTOC~~
\\ 
<WRAP centeralign bigger><WRAP bigger fgred>Corning Community College</WRAP>
\\ 
<WRAP muchbigger>Data Structures</WRAP> 
\\ 
\\ 
Comprehensive Linked List Program</WRAP>

=====Objective=====
To continue to expose you to the concepts inherent to linked lists.

=====Exercise=====
As an exercise testing your skills with dynamic singly linked lists, I'd like for you to undertake the following assignment:

  * create a program that does the following:
    * utilizes struct-based nodes
    * nodes can be identical to the ones we've used-- containing a single integer
    * upon running, presents the user with a menu, having the following options:
      * build list
      * view list
      * clear list
      * insert new node (before specified node)
      * append new node (after specified node)
      * delete specified node
      * exit
  * your program must successfully operate regardless of the inputs given (0 nodes, 1 node, 17 nodes, etc.)
  * document your code with intuitive commenting
  * If you'd like a bit of an added challenge
      * extra: reverse list (HINT: likely very useful process for your freecell project)
      * extra: sort the list (from least to greatest)

=====Submission=====
Please send to my lab46 account (wedge@lab46.corning-cc.edu) the **source code** of your completed program.