Efficient algorithms to create and maintain balanced and threaded binary search trees

This publication has 3 references indexed in Scilit:

• Efficient algorithms to globally balance a binary search tree
  Communications of the ACM, 1984
• Discussion and correspondence: The proposed new standard for FORTRAN: A critical examination
  The Computer Journal, 1976
• Optimizing binary trees grown with a sorting algorithm
  Communications of the ACM, 1972