
doi: 10.46298/dmtcs.304
q-binary search trees are obtained from words, equipped with a geometric distribution instead of permutations. The average and variance of the heighth computated, based on random words of length n, as well as a Gaussian limit law.
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], QA1-939, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], binary search tree, \(q\)-analogue, q-analogue, Searching and sorting, Mathematics, height
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], QA1-939, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], binary search tree, \(q\)-analogue, q-analogue, Searching and sorting, Mathematics, height
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
