Results 261 to 270 of about 2,331,322 (315)
Some of the next articles are maybe not open access.
On the Height of Height-Balanced Trees
IEEE Transactions on Computers, 1976Height-balanced binary trees with height unbalances up to ? are investigated, and the asymptotic value of the height h of such trees is studied for an increasing number of nodes N. It is shown that, in the worst case, the asymptotic value of h is a logarithmic function of N: [h = K log N] n?? . Specifically, an upper bound for h can be posed as: h ?
Fabrizio Luccio, Linda Pagli
openaire +1 more source