An empirical study of insertion and deletion in binary search trees

Jeffrey L. Eppinger
1983 Communications of the ACM  
Jeff Eppinger's current interests include distributed systems, database design, and analysis of algorithms.
doi:10.1145/358172.358183 fatcat:wgelx2upffhlhf66heqsq6cnxi