tree rebalancing

In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its height (number of levels below the root) small in the face of arbitrary item insertions and deletions. These structures provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets.

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

• Reference 1: google.com
• Reference 2:wikipedia.com
• Reference 3: yahoo.com

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

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$