Interview pain series - red-black tree in the end is what kind of data structure? ? ?

Red-black tree notes

 

Red-black tree is a kind of advanced data structures. Occasionally interview will ask. The same point as long as the application of such knowledge to master scene on it.

Also from Mouwang course. Interestingly, the course teachers will implement the method summarized in the red-black tree "can be considered a fixed pattern," just follow the prescribed steps to achieve, you can achieve a red-black tree. Of course, this is also specializing in the algorithm of people have come up these steps, we are really standing on the shoulders of giants.