Adel'son-Vel'skiĭ, G. & Landis, Y. (1962) An algorithm for the organization of information, Dokl. Akad. Nauk SSSR, 146: 263–266. English translation in Soviet Math. Dokl. 3: pp. 1259–1263.
Aho, A. V., Hopcroft, J. E. & Ullman, J. D. (1974) The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company.
Bayer, R. (1972) Symmetric binary B-trees: Data structure and maintenance algorithms, Acta Inform., 1: 290–306.
Bird, R. (1998) Introduction to Functional Programming using Haskell. 2nd ed.Prentice Hall.
Guibas, L. J., McCreight, E. M., Plass, M. F. & Roberts, J. R. (1977) A new representation for linear lists. In Conference Record of the 9th Annual ACM Symposium on Theory of Computing, Boulder, Colorado, United States, pp. 49–60.
Guibas, L. J. & Sedgewick, R. (1978) A dichromatic framework for balanced trees. In Proceedings of the 19th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, pp. 8–21.
Hinze, R. (1999) Constructing red-black trees. In Proceedings of the Workshop on Algorithmic Aspects of Advanced Programming Languages, WAAAPL'99, Paris, France, Okasaki, C. (ed). Columbia University, pp. 89–99 (Technical Report, CUCS-023-99).
Hinze, R. & Paterson, R. (2006) Finger trees: A simple general-purpose data structure, J. Funct. Program., 16 (2): 197–217.
Kahrs, S. (2001) Functional Pearl: Red-black trees with types, J. Funct. Program., 11 (4): 425–432.
Myers, E. W. (1984) Efficient applicative data types. In Proceedings of the 11th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, Salt Lake City, UT, Kennedy, Ken, van Deusen, Mary S., and Landweber, Larry (eds.). ACM, pp. 66–75.
Okasaki, C. (1998) Purely Functional Data Structures. Cambridge University Press.
Okasaki, C. (1999) Functional pearl: Red-black trees in a functional setting, J. Funct. Program., 9 (4): 471–477.
Ottmann, T., Six, H.-W. & Wood, D. (1979) On the correspondence between AVL trees and brother trees, Computing, 23, 43–54.
Reade, C. (1992) Balanced trees with removals: An exercise in rewriting and proof, Sci. Comput. Program., 18 (2): 181–204.