Red-Black Tree in Google go language

Spend few days in learning Google go language and (learned and) implemented Red-Black tree in go lang.

Here is my implementation of Red-Black tree @ github.

Red-Black tree data structure can be used to implement dictionaries with fast look up. The same data structure is used by Linux CFS scheduler.

In the upcoming days I will try to write few posts explaining RB tree implementation details.

I have mainly referred below lectures to learn RB tree concept.

1. Lecture - 14 Red Black Trees
2. Lecture - 15 Insertion in Red Black Trees

Also take a look at the unit test cases (in the rbtree_test folder) and associated comments, which I hope will really help you while you follow above lectures.