{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T21:09:49Z","timestamp":1672261789770},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,7,1]],"date-time":"1987-07-01T00:00:00Z","timestamp":552096000000},"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":9513,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1987,7]]},"DOI":"10.1016\/0890-5401(87)90009-5","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"15-32","source":"Crossref","is-referenced-by-count":6,"title":["On the recursion depth of special tree traversal algorithms"],"prefix":"10.1016","volume":"74","author":[{"given":"Peter","family":"Kirschenhofer","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(87)90009-5_BIB1","series-title":"Asymptotic methods in analysis","author":"de Bruijn","year":"1958"},{"key":"10.1016\/0890-5401(87)90009-5_BIB2","series-title":"Graph Theory and Computing","first-page":"15","article-title":"The average height of planted plane trees","author":"de Bruijn","year":"1972"},{"key":"10.1016\/0890-5401(87)90009-5_BIB3","first-page":"1","article-title":"Analyse d'algorithmes de manipulation d'arbres et de fichiers","volume":"34\u201335","author":"Flajolet","year":"1981","journal-title":"Cahiers de BURO"},{"key":"10.1016\/0890-5401(87)90009-5_BIB4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","article-title":"The average height of binary trees and other simple trees","volume":"25","author":"Flajolet","year":"1982","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0890-5401(87)90009-5_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(79)90009-4","article-title":"The number of registers required to evaluate arithmetic expressions","volume":"9","author":"Flajolet","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(87)90009-5_BIB6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0097-3165(85)90089-5","article-title":"q-Catalan numbers","volume":"40","author":"F\u00fcrlinger","year":"1985","journal-title":"J. Comb. Theory A"},{"key":"10.1016\/0890-5401(87)90009-5_BIB7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00289094","article-title":"The average number of registers needed to evaluate a binary tree optimally","volume":"11","author":"Kemp","year":"1979","journal-title":"Acta Inf."},{"key":"10.1016\/0890-5401(87)90009-5_BIB8","author":"Knuth","year":"1973"},{"key":"10.1016\/0890-5401(87)90009-5_BIB9","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/S0021-9800(69)80113-4","article-title":"On the number of certain lattice polygons","volume":"6","author":"Polya","year":"1969","journal-title":"J. Comb. Theory"},{"key":"10.1016\/0890-5401(87)90009-5_BIB10","first-page":"51","article-title":"The height of planted plane trees revisited","volume":"16-B","author":"Prodinger","year":"1983","journal-title":"Ars Combinatoria"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900095?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900095?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:26:09Z","timestamp":1548897969000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540187900095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,7]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,7]]}},"alternative-id":["0890540187900095"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(87)90009-5","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1987,7]]}}}