• DocumentCode
    2184471
  • Title

    Lower bounds for accessing binary search trees with rotations

  • Author

    Wilber, Robert

  • fYear
    1986
  • fDate
    27-29 Oct. 1986
  • Firstpage
    61
  • Lastpage
    70
  • Abstract
    We describe two methods for obtaining lower bounds on the cost of accessing a sequence of nodes of a symmetrically ordered binary search tree, where rotations can be done on the tree. The bounds apply to offline as well as online algorithms.
  • Keywords
    Binary search trees; Binary trees; Costs; Heuristic algorithms; Mirrors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1986., 27th Annual Symposium on
  • Conference_Location
    Toronto, ON, Canada
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0740-8
  • Type

    conf

  • DOI
    10.1109/SFCS.1986.28
  • Filename
    4568196
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2184471