Performance of height-balanced trees

doi:10.1145/359970.359989

Performance of height-balanced trees

Full Text:

PDF

Buy this Article

Authors:	P. L. Karlton	Carnegie-Mellon Univ., Pittsburgh, PA
	S. H. Fuller	Carnegie-Mellon Univ., Pittsburgh, PA
	R. E. Scroggs	Carnegie-Mellon Univ., Pittsburgh, PA
	E. B. Kaehler	Carnegie-Mellon Univ., Pittsburgh, PA

	1976 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 25 · Downloads (cumulative): 565 · Citation Count: 17

Published in:

	· Magazine
	Communications of the ACM CACM Homepage archive
	Volume 19 Issue 1, Jan. 1976 Pages 23-28 ACM New York, NY, USA table of contents doi>10.1145/359970.359989

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: avl trees balanced trees hb[k] trees information storage and retrieval searching

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder