{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T10:11:10Z","timestamp":1648980670975},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:p> A simple algorithm is given to rebalance a binary search tree of optimal height after a single update. The algorithm uses time which is linear in the number of nodes. In comparison to previous algorithms it is short and very easy to implement. Moreover, this algorithm can be used to implement other classes of balanced trees and it is suitable for each update. When applied to perfectly balanced trees it has a lower average cost than previous algorithms. <\/jats:p>","DOI":"10.1142\/s012905419400013x","type":"journal-article","created":{"date-parts":[[2004,11,19]],"date-time":"2004-11-19T02:21:13Z","timestamp":1100830873000},"page":"247-260","source":"Crossref","is-referenced-by-count":0,"title":["DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING"],"prefix":"10.1142","volume":"05","author":[{"given":"RUDI","family":"MAELBR\u00c1NCKE","sequence":"first","affiliation":[{"name":"Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, Heverlee, B-3001, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HENK","family":"OLIVI\u00c9","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, Heverlee, B-3001, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905419400013X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:44:07Z","timestamp":1565138647000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905419400013X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":0,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1142\/S012905419400013X"],"URL":"https:\/\/doi.org\/10.1142\/s012905419400013x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}