Time- and Space-optimal height-balanced 2-3 brother trees

References

• Bitner , J. R. and Haung , S. H. 1981 . Key comparison optimal 2-3 trees with maximal utilization . SIAM J. on Computing , 10 ( No. 3 ) : 558 – 570 .
   Web of Science ®Google Scholar
• Knuth , D. E. 1973 . “ The Art of Computer Programming ” . In Sorting and Searching , Vol. 3 , Reading, MA : Addison-Wesley .
   Google Scholar
• Kriegel , H. P. , Vaishnavi , V. K. and Wood , D. 1978 . 2-3 brother trees . BIT , 18 ( 4 ) : 425 – 435 .
   Google Scholar
• Miller , R. E. , Pippenger , N. , Rosenberg , A. L. and Snyder , L. 1979 . Optimal 2-3 trees . SIAM J. on Computing , 8 ( No. 1 ) : 42 – 59 .
   Web of Science ®Google Scholar
• Ottmann Th. Rosenberg A. L. Six H. W Wood D. Minimal cost brother trees Computer Science Technical Report, No. 79-CS-1
   Google Scholar
• Rosenberg , A. L. and Snyder , L. 1978 . Minimal comparison 2,3-trees . SIAM J. on Computing , 7 ( No. 4 ) : 465 – 480 .
   Web of Science ®Google Scholar
• Rosenberg , A. L. and Snyder , L. 1981 . Time- and space-optimality in B-trees . ACM Trans. on Data Base Systems , 6 ( No. 1 ) : 174 – 193 .
   Web of Science ®Google Scholar
• Vaishnavi , V. K. , Kriegel , H. P. and Wood , D. 1979 . Height-balanced 2-3 trees . Computing , 21 ( No. 1 ) : 195 – 211 . Fasc. 3
   Google Scholar