Red-black tree is a self-balancing binary search tree. 红黑树(RBT)是一个自平衡的二叉查找树。
A red-black tree is a tree with a couple of interesting and useful properties. 红黑树(RBT)是一个树,具有很多有趣、有用的属性。
This function simply picks the left-most task from the red-black tree and returns the associated sched_entity. 此函数只是从红黑树(RBT)中获取最左端的任务并返回相关schedentity。
Leaves in a red-black tree contain no information, but internal nodes represent one or more tasks that are runnable. 红黑树(RBT)的叶子不包含信息,但是内部节点代表一个或多个可运行的任务。
A red-black tree ( or symmetric binary B-tree ) is a self-balancing binary tree invented by Rudolf Bayer. 红黑树(RBT)(平衡二叉树)是自平衡二叉树,由RudolfBayer发明。