Recursive PGFs for BSTs and DSTs
Data Structures and Algorithms
2020-02-10 v1 History and Overview
Probability
Abstract
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.
Cite
@article{arxiv.2002.02809,
title = {Recursive PGFs for BSTs and DSTs},
author = {Steven Finch},
journal= {arXiv preprint arXiv:2002.02809},
year = {2020}
}
Comments
16 pages, 6 figures