| 1. | Figure 4 shows an example of a red - black tree
图4显示了红黑树的示例： |
| 2. | These are called the four prerequisites of a red - black tree
这些称为红黑树的四个先决条件。 |
| 3. | Learn more about red - black trees
了解关于红黑树的更多信息 |
| 4. | Overview of red - black tree technology
红黑树技术概述 |
| 5. | A bst is a red - black tree if
Bst为红黑树，如果： |
| 6. | We ll use the red - black tree structure to provide priority - based message processing because
我们将使用红黑树结构来提供基于优先级的消息处理，因为： |
| 7. | Implements interface bundlemessagequeue based on java s red - black tree implementation , treeset
基于java的红黑树实现treeset实现接口bundlemessagequeue 。 |
| 8. | After the new node is inserted and marked as red , the four prerequisites of a red - black tree are checked
插入新节点并将其标记为红之后，将检查红黑树的四个先决条件。 |
| 9. | A lightweight implementation of a red - black tree is included in the j2me specification class java . util . treeset
红黑树的轻量级实现包括在j2me规范类java . util . treeset中。 |
| 10. | A red - black tree is a data structure and open technology that can be used for predefined priority - based sorting operations
红黑树是可用于预定义基于优先级的排序操作的数据结构和开放技术。 |
