On the collection of fringe subtrees in random binary trees

DOI10.1007/978-3-030-61792-9_43OpenAlexW3116067289MaRDI QIDQ2081652

Yanyan Li

Publication date: 13 October 2022

Full work available at URL: https://arxiv.org/abs/2003.03323

zbMATH Keywords

tree compressionrandom binary search treesfringe subtreesuniformly random binary trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (2)

Compaction for two models of logarithmic‐depth trees: Analysis and experiments ⋮ Distinct fringe subtrees in random trees

This page was built for publication: On the collection of fringe subtrees in random binary trees