Tree Transversal
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.
Recursion
Recursion is one technique for representing data that's size is not always known by the programmer. The implementation of recursion would be a function calling it's self in the function, there fore creating an infinite number of computations.
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
Identification of chosen keyword.
Definition (in your own words) of the chosen keyword.
List any sites, books, or sources utilized when researching information on this topic. (Remove any filler text).
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:
/* * Sample code block */ #include <stdio.h> int main() { return(0); }
Alternatively (or additionally), if you want to demonstrate something on the command-line, you can do so as follows:
lab46:~$ cd src lab46:~/src$ gcc -o hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$
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:
/* * Sample code block */ #include <stdio.h> int main() { return(0); }
Alternatively (or additionally), if you want to demonstrate something on the command-line, you can do so as follows:
lab46:~$ cd src lab46:~/src$ gcc -o hello hello.c lab46:~/src$ ./hello Hello, World! lab46:~/src$