Create placeholders for a graph module and associated algorithms
Create placeholder files for linked list implementations
Complete stack and queue examples
Create modules for ListNodes, TreeNodes, and GraphNodes for use in other data structure examples
Complete traversal algorithm examples and create Binary Tree module. TODO: implement breadth first and depth first algorithms
Clearing up deleted files.
Merge pull request #3 from patrickreynolds/patrick

Update continuity with most recent implementations of generic algorithms. Still quite a bit of room for polish.