论文标题
BST和DST的递归PGF
Recursive PGFs for BSTs and DSTs
论文作者
论文摘要
我们回顾了二进制搜索树和数字搜索树的基本原理，并（非典型）强调了递归公式，以实现相关的概率生成功能。其他主题包括较高的BST搜索成本时刻和某些有限键模拟DST的组合学。
We review fundamentals underlying binary search trees and digital search trees, with (atypical) emphasis on recursive formulas for associated probability generating functions. Other topics include higher moments of BST search costs and combinatorics for a certain finite-key analog of DSTs.
