{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:41:30Z","timestamp":1757544090446},"reference-count":11,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0304-3975(90)90037-i","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"251-264","source":"Crossref","is-referenced-by-count":7,"title":["A tight upper bound for the path length of AVL trees"],"prefix":"10.1016","volume":"72","author":[{"given":"Rolf","family":"Klein","sequence":"first","affiliation":[]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90037-I_BIB1","first-page":"263","article-title":"An algorithm for the organization of information","volume":"146","author":"Adel'son-Vel'skii","year":"1962","journal-title":"Dokl. Akad. Nauk"},{"key":"10.1016\/0304-3975(90)90037-I_BIB2","unstructured":"A. Br\u00fcggemann-Klein and D. Wood, Drawing trees nicely with TEX, Electronic Publishing, Origination Dissemination, and Design, to appear."},{"key":"10.1016\/0304-3975(90)90037-I_BIB3","first-page":"192","article-title":"Information storage and retrieval using AVL trees","author":"Foster","year":"1965","journal-title":"Proc. ACM National Conference"},{"key":"10.1016\/0304-3975(90)90037-I_BIB4","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1145\/358476.358509","article-title":"Balancing binary trees by internal path reduction","volume":"26","author":"Gonnet","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(90)90037-I_BIB5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0890-5401(87)90053-8","article-title":"The node visit cost of brother trees","volume":"75","author":"Klein","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(90)90037-I_BIB6","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/62044.62048","article-title":"On the path length of binary trees","volume":"36","author":"Klein","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90037-I_BIB7","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(90)90037-I_BIB8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0213015","article-title":"Minimal-cost brother trees","volume":"13","author":"Ottman","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90037-I_BIB9","first-page":"395","article-title":"Eine neue Klasse von ausgeglichen Bin\u00e4rb\u00e4umen","volume":"9","author":"Ottmann","year":"1976","journal-title":"Angew. Inform."},{"key":"10.1016\/0304-3975(90)90037-I_BIB10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02252612","article-title":"On the correspondence between AVL trees and brother trees","volume":"23","author":"Ottmann","year":"1979","journal-title":"Computing"},{"key":"10.1016\/0304-3975(90)90037-I_BIB11","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1093\/comjnl\/23.3.248","article-title":"1-2 brother trees or AVL trees revisited","volume":"23","author":"Ottmann","year":"1981","journal-title":"Comput. J."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090037I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090037I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:24Z","timestamp":1555127484000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090037I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":11,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["030439759090037I"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90037-i","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}