{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T15:54:31Z","timestamp":1648828471564},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,7]]},"DOI":"10.1016\/0020-0190(92)90038-w","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"287-292","source":"Crossref","is-referenced-by-count":2,"title":["A note on the path length of red\u2013black trees"],"prefix":"10.1016","volume":"42","author":[{"given":"Helen","family":"Cameron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90038-W_BIB1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF00289509","article-title":"Symmetric binary B-trees: Data structure and maintenance algorithms","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(92)90038-W_BIB2","article-title":"Extremal cost binary trees","author":"Cameron","year":"1991"},{"key":"10.1016\/0020-0190(92)90038-W_BIB3","author":"Cameron","year":"1991","journal-title":"The iterative and defined classes of red-black trees"},{"key":"10.1016\/0020-0190(92)90038-W_BIB4","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978","journal-title":"Proc. 19th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(92)90038-W_BIB5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(90)90037-I","article-title":"A tight upper bound for the path length of AVL trees","volume":"72","author":"Klein","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90038-W_BIB6","author":"Knuth","year":"1968"},{"key":"10.1016\/0020-0190(92)90038-W_BIB7","article-title":"A study of balanced binary trees and balanced one-two-trees","author":"Olivi\u00e9","year":"1980"},{"key":"10.1016\/0020-0190(92)90038-W_BIB8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1051\/ita\/1982160100511","article-title":"A new class of balanced search trees: Half-balanced binary search trees","volume":"16","author":"Olivi\u00e9","year":"1982","journal-title":"RAIRO Inform. Th\u00e9or."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290038W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290038W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:38Z","timestamp":1555129658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290038W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290038W"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90038-w","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}