A method for constructing binary search trees by making insertions at the root-Reference-Cited by-同舟云学术

A method for constructing binary search trees by making insertions at the root

Published:1980-02 Issue:1 Volume:9 Page:15-29
ISSN:0091-7036
Container-title:International Journal of Computer & Information Sciences
language:en
Short-container-title:International Journal of Computer and Information Sciences

Author:

Stephenson C. J.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science,Information Systems,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00995807.pdf

Reference8 articles.

1. W. H. Burge, ?An Analysis of a Tree Sorting Method and Some Properties of a Set of Trees,?Proceedings of the First USA-Japan Computer Conference (1972), pp. 372?379.

2. W. H. Burge, ?A Correspondence Between Two Sorting Methods,? IBM Research Report, RC 6397 (1977).

3. Clark A. Crane, ?Linear Lists and Priority Queues as Balanced Binary Trees,? Ph.D. Thesis, Stanford University, Computer Science Department Report, STAN-CS-72-259 (1972).

4. Fred G. Gustavson and Werner Liniger. ?A fast random number generator with good statistical properties,?Computing 6:221?226 (1970).

5. T. N. Hibbard, ?Some combinatorial properties of certain trees with applications to searching and sorting,?JACM 9(1):13?28 (1962).

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Functional Essence of Imperative Binary Search Trees;Proceedings of the ACM on Programming Languages;2024-06-20

2. A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees;SN Computer Science;2022-07-14

3. Zip Trees;ACM Transactions on Algorithms;2021-10-31

4. Zip Trees;Lecture Notes in Computer Science;2019

5. An asymptotic theory for Cauchy–Euler differential equations with applications to the analysis of algorithms;Journal of Algorithms;2002-07