=====data Keyword 3=====
Identification of chosen keyword.

====Definition====
Definition (in your own words) of the chosen keyword.

====References====
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).

  * Reference 1
  * Reference 2
  * Reference 3



=====data Keyword 3 Phase 2=====
Tree Transversal
====Definition====
Tree traversal is the way that one can move around a binary tree. The method in which you move around and use the data can change what you are doing (sorting, printing from least to greatest, etc.).
Because of the way that the tree works, one can do it iteratively, recursively, or stack based.  The values have to be manipulated / stored outside of the tree as you traverse it, using a queue or a stack etc.

====References====
http://en.wikipedia.org/wiki/Tree_traversal#Traversals
====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
 */
#include <stdio.h>

int main()
{
    return(0);
}
</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 hello hello.c
lab46:~/src$ ./hello
Hello, World!
lab46:~/src$ 
</cli>