Sciweavers

FODO   1989 International Conference on Foundations of Data Organization and Algorithms
Wall of Fame | Most Viewed FODO-1989 Paper
FODO
1989
Springer
268views Algorithms» more  FODO 1989»
13 years 8 months ago
The Path Length of Binary Trees
We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the d...
Rolf Klein, Derick Wood
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source268
2Download preprint from source164
3Download preprint from source89
4Download preprint from source68
5Download preprint from source67