We consider the task of constructing 2-3 trees. Given a sequence of elements we seek to build a 2-3 tree–in linear time–that contains the elements in symmetric order. We discuss three approaches: top-down, bottom-up, and incremental. The incremental approach is more flexible than the other two in that it allows us to interleave the construction work with other operations, for example, queries.

中文翻译：

---

在构建 2-3 棵树时

我们考虑构建 2-3 棵树的任务。给定一系列元素，我们试图在线性时间内构建一个 2-3 树，其中包含对称顺序的元素。我们讨论三种方法：自上而下、自下而上和增量。增量方法比其他两种方法更灵活，因为它允许我们将构建工作与其他操作（例如查询）交错。