Binary search trees - Data Structures and Problem Solving Using Java - page 771

9. K. Culik, T. Ottman, and D. Wood, “Dense Multiway Trees,” ACM
Transactions on Database Systems 6 (1981), 486-512.
10. J. L. Eppinger, “An Empirical Study of Insertion and Deletion in Binary
Search Trees,” Communications of the ACM 26 (1983), 663-669.
11. P. Flajolet and A. Odlyzko, “The Average Height of Binary Search Trees
and Other Simple Trees,” Journal of Computer and System Sciences 25
(1982), 171-213.
12. B. Flamig, Practical Data Structures in C++ , John Wiley & Sons, New
York, NY, 1994.
13. G. H. Gonnet and R. Baeza-Yates, Handbook of Algorithms and Data
Structures, 2d ed., Addison-Wesley, Reading, MA, 1991.
14. E. Gudes and S. Tsur, “Experiments with B-tree Reorganization,” Pro-
ceedings of ACM SIGMOD Symposium on Management of Data (1980),
200-206.
15. L. J. Guibas and R. Sedgewick, “A Dichromatic Framework for Balanced
Trees,” Proceedings of the Nineteenth Annual IEEE Symposium on Foun-
dations of Computer Science (1978), 8-21.
16. T. H. Hibbard, “Some Combinatorial Properties of Certain Trees with
Applications to Searching and Sorting,” Journal of the ACM 9 (1962),
13-28.
17. A. T. Jonassen and D. E. Knuth, “A Trivial Algorithm Whose Analysis
Isn't,” Journal of Computer and System Sciences 16 (1978), 301-322.
18. D. E. Knuth, The Art of Computer Programming: Vol. 1: Fundamental
Algorithms , 3d ed., Addison-Wesley, Reading, MA, 1997.
19. D. E. Knuth, The Art of Computer Programming: Vol. 3: Sorting and
Searching , 2d ed., Addison-Wesley, Reading, MA, 1998.
20. K. Melhorn, “A Partial Analysis of Height-Balanced Trees Under Ran-
dom Insertions and Deletions,” SIAM Journal on Computing 11 (1982),
748-760.
21. R. Sedgewick, Algorithms in C++ , Parts 1-4 (Fundamental Algorithms,
Data Structures, Sorting, Searching) 3rd ed., Addison-Wesley, Reading,
MA, 1998.