"Splaying a search tree in preorder takes linear time."

Ranjan Chaudhuri, Hartmut Höft (1993)

Details and statistics

DOI: 10.1145/156063.156067

access: closed

type: Journal Article

metadata version: 2020-07-07

a service of  Schloss Dagstuhl - Leibniz Center for Informatics