These are called the four prerequisites of a red-black tree. 這些稱(chēng)為紅黑樹(shù)的四個(gè)先決條件。
A red-black tree is a data structure and open technology that can be used for predefined priority-based sorting operations. 紅黑樹(shù)是可用于預定義基于優(yōu)先級的排序操作的數據結構和開(kāi)放技術(shù)。