Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Binary search trees with limited rotation

From MaRDI portal
Publication:1056233
Jump to:navigation, search

DOI10.1007/BF01933619zbMath0522.68058OpenAlexW2006964051MaRDI QIDQ1056233

J. Blot

Publication date: 1983

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933619


zbMATH Keywords

binary treesearching23, 436-455 (1983)parameterized binary search tree


Mathematics Subject Classification ID

Searching and sorting (68P10)


Related Items (2)

Height balance distribution of search trees ⋮ Average number of rotations access cost in iR-trees



Cites Work

  • On random 2-3 trees
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Binary search trees with limited rotation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1056233&oldid=13073275"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 23:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki