Understand the Linux kernel red-black tree in one article

Hello everyone, I am Peter. Friends who have read my article " Vomiting Blood | Overcoming All the Knowledge Points of Linux Process Scheduling " should understand the importance of red-black trees in process scheduling. The original article did not describe the implementation of red-black trees in detail. Today I recommend you a document specifically about red-black trees, which is:

ACM gold medalist shows you how to tear apart red-black trees!

1 video to solve data structure problems

Make up for shortcomings + make breakthroughs

Readers of this account can get it for free

To judge a person's coding level, we should not look at the complexity of his/her code, but look at his/her data structure and algorithm through the code .

It can be said that data structure and algorithm knowledge is the basic skill of a programmer, and it is also necessary to examine it in job-hunting written tests and interviews. Among them , red-black trees can be said to be the nightmare of many beginners.

• The red-black tree adjustment strategy has been optimized, which is easier to understand and remember than traditional operations, helping us to quickly and deeply understand the characteristics of red-black trees.
  

  
  

• Use concise and efficient code to help us implement the red-black tree (only about 200 lines of code), and try to make everyone able to "tear the red-black tree by hand".

  
  

• At the end of the course, summarized knowledge points will be output to assist in review and understanding.