RT Journal Article
T1 Binary search trees, recurrent properties and wave equations
A1 Fernández Camacho, María Inés
A1 Sánchez Couso, José Ramón
AB We give a generic framework to analyze the average-case running time for computing the so-called recurrent properties for pairs of binary search trees. Recurrent properties are algorithms that operate on pairs of trees testing some characteristic on nodes by performing a preorder traversal on both trees. Analysis of recurrent properties using the probability model associated with randomly grown binary search trees leads to wave equations. We use a “normalized" integral equation as a pattern to model a specific wave equation and investigate the asymptotic behavior of its solution. This methodology is applied to some particular cases of recurrent properties like testing equality, detecting direct occurrences and clashes or pattern matching
PB IOS Press
SN 0169-2968
YR 2007
FD 2007
LK https://hdl.handle.net/20.500.14352/50537
UL https://hdl.handle.net/20.500.14352/50537
LA eng
DS Docta Complutense
RD 19 abr 2025