Splaying a search tree in preorder takes linear time.
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Optimal Poiseuille flow in a finite elastic dyadic tree”
Splaying a search tree in preorder takes linear time.
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:
Deducing Properties of Trees From Their Matula Numbers
Ivan Gutman, Yeong-Nan Yeh (1993)
Publications de l'Institut Mathématique
Similarity:
An axiomatic theory of information trees
Keh-Hsun Chen, Zbigniew W. Ras (1988)
Banach Center Publications
Similarity:
On the normal disconnection of a tree
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
NP-completeness of minimal width unordered tree layout.
Marriott, Kim, Stuckey, Peter J. (2004)
Journal of Graph Algorithms and Applications
Similarity: