=====data Keyword 2=====
linked list

====Definition====
A linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of data and a link to the next node in the sequence; more complex variants add additional links. This structure allows for efficient insertion or removal of elements from any position in the sequence.
====References====
  *http://en.wikipedia.org/wiki/Linked_list

=====data Keyword 2 Phase 2=====
stack overflow condition

====Definition====
A stack overflow is when to much memory is used when creating a stack.  when a stack is created it uses something called a push which is basically the append function in a linked list.  The push will "Push" something on the stack.  similar to a stack of papers the "push" puts a paper on the top of the stack.  A stack overflow is when you put to many papers on the stack.  

====References====

*http://en.wikipedia.org/wiki/Stack_overflow
====Demonstration====
Demonstration of the indicated keyword.

If you wish to aid your definition with a code sample, you can do so by using a wiki **code** block, an example follows:

<code c>
/*
 * Sample code block
 */
   int foo() {
     return foo();
   }
   
</code>

Alternatively (or additionally), if you want to demonstrate something on the command-line, you can do so as follows:

<cli>
lab46:~$ cd src
lab46:~/src$ gcc -o sample
lab46:~/src$ ./sample
Segmentation Fault
lab46:~/src$ 
</cli>