prefix (polish) notation

Polish Notation, also known as Prefix Notation, is a form of notation that puts the operator at the beginning instead of between two numbers or other operations. Example:

• (20 - 11) * 5 is represented as *(- 20 11) 5

• http://en.wikipedia.org/wiki/Polish_notation

Iterative Tree Traversal

Iterative Tree Traversal is the act of moving through a binary tree by the use of repetition. The function would most likely have nested for loops, which will result in more code than that of recursive tree traversal.

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

• Reference 1
• Reference 2
• Reference 3

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:

/*
 *
 * PSEUDO CODE
 *
 */
 
 
    queue[7] = 11, 22, 33, 44, 55, 66, 77;
    queuevalue = queue[0];
 
    while node -> left != NULL
        node = node -> left;
 
    node -> value = queuevalue;
 
    node = node -> parent;
    node -> value = queue[1];
 
    /* And this goes on until the tree is filled, resulting in:
 
                44
        22              66
    11      33      55      77
*/