Fringe analysis of binary search trees with miniml internal path length

Authors:
Faris N. Abuali;Roger L. Wainwright
Affiliations:
Department of Mathematical and Computer Sciences, The University of Tulsa, Tulsa , Oklahoma;Department of Mathematical and Computer Sciences, The University of Tulsa, Tulsa , Oklahoma
Venue:
CSC '91 Proceedings of the 19th annual conference on Computer Science
Year:
1991

Citing 5
Cited 0

Tree rebalancing in optimal time and space

Communications of the ACM
An insertion algorithm for a minimal internal path length binary search tree

Communications of the ACM
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Efficient algorithms to globally balance a binary search tree

Communications of the ACM
Balancing binary trees by internal path reduction

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract