• DocumentCode
    1137483
  • Title

    Rebalancing Height Balanced Trees

  • Author

    Luccio, Fabrizio ; Pagli, Linda

  • Author_Institution
    Istituto di Scienze dell´´Informazione, University of Pisa
  • Issue
    5
  • fYear
    1978
  • fDate
    5/1/1978 12:00:00 AM
  • Firstpage
    386
  • Lastpage
    396
  • Abstract
    A new balancing technique for binary search trees is presented, based on the repositioning of k + 1 nodes (k-rotation) Some properties of k-rotation are shown, and bounds to k are derived. The performance of such a technique is discussed on the basis of the length of node search and the frequency of tree rebalancing.
  • Keywords
    Height balanced trees; information storage and retrieval; rebalancing; rotation; search length; Binary search trees; Binary trees; Computer science; Councils; Frequency; Information retrieval; Resumes; Height balanced trees; information storage and retrieval; rebalancing; rotation; search length;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1978.1675117
  • Filename
    1675117
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1137483