Function Pointer

Instead of referring to data values, a function pointer points to executable code within memory. When dereferenced, a function pointer can be used to invoke the function it points to and pass it arguments just like a normal function call.

• http://en.wikipedia.org/wiki/Function_pointer
• http://www.eskimo.com/~scs/cclass/int/sx10a.html
• http://www.cprogramming.com/tutorial/function-pointers.html

Recursive tree traversal

A tree traversal is the process of examining each node exactly once in a systematic way. Different traversals are classified and named by the process in which they examine the tree. A recursive tree traversal examines the tree recursively which is the process of calling a function within itself. One example of recursion is two mirrors faced towards each other creating an infinite recursion.

• http://www.csit.parkland.edu/~mbrandyberry/CS2Java/Lessons/TreesRecursionGraphs/RecursiveTraversal.shtml
• http://en.wikipedia.org/wiki/Recursion
• http://en.wikipedia.org/wiki/Tree_traversal

Recursive tree transversal

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

• http://www.csit.parkland.edu/~mbrandyberry/CS2Java/Lessons/TreesRecursionGraphs/RecursiveTraversal.shtml

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

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

lab46:~$ Please Enter Values For Tree Traversal (-1 to quit):
Enter Value: 2
Enter Value: 5
Enter Value: 7
Enter Value: 1
Enter Value: 8
Enter Value: 4
Enter Value: 0
Enter Value: 6
Enter Value: -1
lab46:~$ Your Numbers: 2,5,7,1,8,4,0,6

                2
               / \
              1    5
             /    / \
            0    4   7
                    / \ 
                   6   8