Differential search trees can be used for selection with replacement and for a form of selection without replacement. We show that they can be extended to many different types of selection, both with and without replacement. In addition, virtually every aspect of a differential search tree can be modified dynamically. We provide algorithms for making these modifications. Virtually all differential search tree algorithms are straightforward and easy to implement, especially with our preferred implementation, which is both simple and efficient. Differential search tree operations are virtually all logarithmic with the exception of building the tree and dynamically adding leaves to the tree, which are both linear.

中文翻译：

---

使用差分搜索树的有限支持的离散随机变量

差分搜索树可用于带替换的选择和不带替换的选择形式。我们证明它们可以扩展到许多不同类型的选择，无论是否有替换。此外，实际上差分搜索树的每个方面都可以动态修改。我们提供用于进行这些修改的算法。事实上，所有差分搜索树算法都是简单且易于实现的，尤其是我们首选的实现，它既简单又高效。差分搜索树操作实际上都是对数的，除了构建树和向树动态添加叶子（这两种操作都是线性的）。