article

Free access

Optimizing binary trees grown with a sorting algorithm

Authors:

W. A. Martin,

D. N. NessAuthors Info & Claims

Communications of the ACM, Volume 15, Issue 2

Pages 88 - 93

https://doi.org/10.1145/361254.361259

Published: 01 February 1972 Publication History

PDF eReader

Abstract

Items can be retrieved from binary trees grown with a form of the Algorithm Quicksort in an average time proportional to log n, where n is the number of items in the tree. The binary trees grown by this algorithm sometimes have some branches longer than others; therefore, it is possible to reduce the average retrieval time by restructuring the tree to make the branches as uniform in length as possible. An algorithm to do this is presented. The use of this algorithm is discussed, and it is compared with another which restructures the tree after each new item is added.

References

[1]

Adel'son-Vel'skiy, G.M., and Landis, Ye.M. An algorithm for the organization of information. Doklady Akad. Nauk USSR Moscow 16, No. 2 (1962), 263-266. Also available in translation as U.S. Dept. of Commerce OTS, JPRS 17,137, Washington, D.C., and as NASA Document N63-11777.

Google Scholar

[2]

Foster, C.C. Information storage and retrieval using AVL trees. Proc. ACM 20th Nat. Conf. 1965, pp. 192-205.

Digital Library

Google Scholar

[3]

Hibbard, T.N. Some combinatorial properties of certain trees with applications to searching and sorting. J. ACM 6 (May 1963), 206-213.

Digital Library

Google Scholar

[4]

Hoare, C.A.R. Algorithm 63, Partition, and Algorithm 64, Quicksort. Comm. ACM 4, 7 (July 1961), 321.

Digital Library

Google Scholar

[5]

Knuth, D.E. The Art of Computer Programming, Vol. 1, Fundamental Algorithms. Addison-Wesley, Reading, Mass., 1968. Sec. 2.3.4.5.

Digital Library

Google Scholar

[6]

Knuth, D.E. Stanford Comput. Sci. Dept. Memo. Stanford U, Calif.

Google Scholar

[7]

Knott, Gary D. A balanced tree storage and retrieval algorithm. Proc. Symp. on Inform. Storage and Retrieval, Apr. 1971, ACM, pp. 175-196.

Digital Library

Google Scholar

Cited By

View all

Zheng YTan K(2024)Sorting on Byte-Addressable Storage: The Resurgence of Tree StructureProceedings of the VLDB Endowment10.14778/3648160.364818517:6(1487-1500)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.14778/3648160.3648185
Sumathi GSendhilkumar SMahalakshmi GAkila VSivakumar NSaruladha KZayaraz GIlavarasan E(2016)Hybrid Recommendation System using Particle Swarm Optimization and User Access Based RankingProceedings of the International Conference on Informatics and Analytics10.1145/2980258.2980405(1-9)Online publication date: 25-Aug-2016
https://dl.acm.org/doi/10.1145/2980258.2980405
Mahmoud H(2011)BibliographySorting10.1002/9781118032886.biblio(373-387)Online publication date: 26-Oct-2011
https://doi.org/10.1002/9781118032886.biblio
Show More Cited By

Optimizing binary trees grown with a sorting algorithm
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis

Recommendations

Self-adjusting binary search trees

The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all ...
Extremal cost binary trees
Computing minimum spanning trees efficiently
ACM '72: Proceedings of the ACM annual conference - Volume 1

A ubiquitous problem in mathematical programming is the calculation of minimum spanning trees. Minimum spanning tree algorithms find application in such diverse areas as: least cost electrical wiring, minimum cost connecting communication and ...

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1972

Published in CACM Volume 15, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
628
Total Downloads

Downloads (Last 12 months)94
Downloads (Last 6 weeks)21

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zheng YTan K(2024)Sorting on Byte-Addressable Storage: The Resurgence of Tree StructureProceedings of the VLDB Endowment10.14778/3648160.364818517:6(1487-1500)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.14778/3648160.3648185
Sumathi GSendhilkumar SMahalakshmi GAkila VSivakumar NSaruladha KZayaraz GIlavarasan E(2016)Hybrid Recommendation System using Particle Swarm Optimization and User Access Based RankingProceedings of the International Conference on Informatics and Analytics10.1145/2980258.2980405(1-9)Online publication date: 25-Aug-2016
https://dl.acm.org/doi/10.1145/2980258.2980405
Mahmoud H(2011)BibliographySorting10.1002/9781118032886.biblio(373-387)Online publication date: 26-Oct-2011
https://doi.org/10.1002/9781118032886.biblio
Inayat-ur-Rehman Khan SKhayal M(2009)A Survey on Maintaining Binary Search Tree in Optimal ShapeProceedings of the 2009 International Conference on Information Management and Engineering10.1109/ICIME.2009.128(365-369)Online publication date: 3-Apr-2009
https://dl.acm.org/doi/10.1109/ICIME.2009.128
Vinod PPushpa SMaple C(2006)Maintaining a Random Binary Search Tree DynamicallyProceedings of the conference on Information Visualization10.1109/IV.2006.72(483-488)Online publication date: 5-Jul-2006
https://dl.acm.org/doi/10.1109/IV.2006.72
Barnes GNoga JSmith PWiegley JDann WNaps TTymann PBaldwin D(2005)Experiments with balanced-sample binary treesProceedings of the 36th SIGCSE technical symposium on Computer science education10.1145/1047344.1047408(166-170)Online publication date: 23-Feb-2005
https://dl.acm.org/doi/10.1145/1047344.1047408
Barnes GNoga JSmith PWiegley J(2005)Experiments with balanced-sample binary treesACM SIGCSE Bulletin10.1145/1047124.104740837:1(166-170)Online publication date: 23-Feb-2005
https://dl.acm.org/doi/10.1145/1047124.1047408
Andersson A(1999)General Balanced TreesJournal of Algorithms10.1006/jagm.1998.096730:1(1-18)Online publication date: 1-Jan-1999
https://dl.acm.org/doi/10.1006/jagm.1998.0967
Malmi L(1996)A new method for updating and rebalancing tree-type main memory dictionariesNordic Journal of Computing10.5555/642143.6421453:2(111-130)Online publication date: 1-Jun-1996
https://dl.acm.org/doi/10.5555/642143.642145
Das SMin K(1994)A Unified Approach to Construct Search Trees in ParallelProceedings of the 1994 International Conference on Parallel Processing - Volume 0310.1109/ICPP.1994.48(222-226)Online publication date: 15-Aug-1994
https://dl.acm.org/doi/10.1109/ICPP.1994.48
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Self-adjusting binary search trees

Extremal cost binary trees

Computing minimum spanning trees efficiently

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations