Splaying a search tree in preorder takes linear time.

Chaudhuri, R.; Höft, H.

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Splaying a search tree in preorder takes linear time.”

Binary trees, fringe thickness and minimum path length

Helen Cameron, Derick Wood (1995)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

A new class of balanced search trees : half-balanced binary search tress

H. J. Olivié (1982)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

NP-completeness of minimal width unordered tree layout.

Marriott, Kim, Stuckey, Peter J. (2004)

Journal of Graph Algorithms and Applications

Similarity:

Updating approximately complete trees

Tony W. Lai, Derick Wood (1994)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

On the structure of path-like trees

F.A. Muntaner-Batle, Miquel Rius-Font (2008)

Discussiones Mathematicae Graph Theory

Similarity:

We study the structure of path-like trees. In order to do this, we introduce a set of trees that we call expandable trees. In this paper we also generalize the concept of path-like trees and we call such generalization generalized path-like trees. As in the case of path-like trees, generalized path-like trees, have very nice labeling properties.

Search trees and bubble memories

Philippe Flajolet, Thomas Ottmann, Derick Wood (1985)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

Arbitrary weight changes in dynamic trees

Kurt Mehlhorn (1981)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity: