=====data Keyword 3=====
Recursive tree transversal

====Definition====
A form of going through a Tree via recursion.  Recusion is calling the function while still inside the function before finishing the original function.

====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=====
Postfix (reverse polish)

====Definition====
A mathematical notation wherein every operator follows all of its operands. For instance "3 + 4" would be written as "3 4 +". If there are multiple operators the operator is given immediately after its second operand; so the expression written "3 − 4 + 5" in conventional infix notation would be written "3 4 − 5 +"
====References====
http://en.wikipedia.org/wiki/Postfix_notation

====Demonstration====
A simple demonstration of this would be 5 5 + 10 -
which would equal 0

The conventional infix notation is 5+5-10.