Results 261 to 270 of about 258,206 (308)

On Random Binary Trees

Mathematics of Operations Research, 1984
A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally. A generating function for the number of nodes given
Brown, Gerald G., Shubert, Bruno O.
openaire   +2 more sources

Randomized search trees

30th Annual Symposium on Foundations of Computer Science, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seidel, Raimund, Aragon, Cecilia R.
openaire   +1 more source

Home - About - Disclaimer - Privacy