I've been studying red-black tree from the Introduction to Algorithms book by Cormen and others. I might get flamed for this but I believe certain things in that chapter don't really teach the 'why' behind the concepts and even if they do, they stretch into long paragraphs of text which becomes difficult to follow from the diagrams that are like 2 pages back. For eg. the deletion procedure seems quite convoluted to me and the section on it doesn't really explain the logic behind arriving at the given sequence of rotations.
So, please help me out.
