References
- Hirschberg , D. S. 1976 . Hirschberg, An insertion technique for one-sided height-balanced trees . Communications of the ACM , 19 ( 8 ) Aug : 471 – 473 .
- Knuth , D. E. 1973 . The Art of Computer Programming. Volume III: Sorting and Searching , Addison-Wesley . Reading, Mass
- Th. Ottmann H. Six W. Wood D. Right brother trees. Communications of the ACM 1978 to appear
- Räïhä , K.-J. 1977 . An 0(log n) insertion algorithm for one-sided height-balanced binary search trees , Helsinki : Manuscript .
- Zweben , S. H. 1977 . An optimal insertion method for one-sided height-balanced trees , Ohio : Manuscript .
- Zweben S. H. Mc Donald M. A. An optimal method for deletion in one-sided height-balanced trees. Communications of the ACM 1978 to appear