2–3–4 trees are an isometry of red–black trees, meaning that they are equivalent data structures.
2-3-4 树是紅黑樹的一种等同，这意味着它们是等价的数据结构。