Notes on protected nodes in digital search trees

DOI10.1016/j.aml.2011.11.017zbMath1244.05055arXiv1111.1471OpenAlexW2157896076MaRDI QIDQ419140

Rosena R. X. Du, Prodinger, Helmut

Publication date: 18 May 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

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

zbMATH Keywords

digital search trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (14)

Protected Branches in Ordered Trees ⋮ Protection number in plane trees ⋮ On the peel number and the leaf-height of Galton–Watson trees ⋮ Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees ⋮ Protected cells in compositions ⋮ \(k\)-protected vertices in binary search trees ⋮ DEGREE PROFILE OF m-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION ⋮ Asymptotic expectation of protected node profile in random digital search trees ⋮ \(k\)-protected vertices in unlabeled rooted plane trees ⋮ Asymptotic distribution of two-protected nodes in random binary search trees ⋮ Protected Vertices in Motzkin trees ⋮ On 2-protected nodes in random digital trees ⋮ On a random search tree: asymptotic enumeration of vertices by distance from leaves ⋮ Limiting probabilities for vertices of a given rank in 1-2 trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Protected points in \(k\)-ary trees
• Mellin transforms and asymptotics: Finite differences and Rice's integrals
• Asymptotics of the moments of extreme-value related distribution functions
• Protected points in ordered trees
• Asymptotic variance of random symmetric digital search trees
• Digital Search Trees Revisited
• External Internal Nodes in Digital Search Trees via Mellin Transforms

This page was built for publication: Notes on protected nodes in digital search trees