Recursive PGFs for BSTs and DSTs
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
