Red Black Trees

Studied using the Red Black Trees (Balanced Binary Trees) in the Linux kernel. Also wrote some sample C programs to test the functionality. The deadline I/O scheduler implementation in the 2.6 kernel makes use of these for keeping a sorted queues of read and write requests.