红黑树的叶子不包含信息，但是内部节点代表一个或多个可运行的任务。
Leaves in a red-black tree contain no information, but internal nodes represent one or more tasks that are runnable.
红黑树在时间和空间之间达成了妥协。
为了公平，调度器然后选取红黑树最左端的节点调度为下一个以便保持公平性。
The scheduler then, to be fair, picks the left-most node of the red-black tree to schedule next to maintain fairness.
应用推荐