{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T01:56:54Z","timestamp":1778723814209,"version":"3.51.4"},"reference-count":4,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1988,8,1]],"date-time":"1988-08-01T00:00:00Z","timestamp":586396800000},"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":[[1988,8]]},"DOI":"10.1016\/0020-0190(88)90177-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"297-299","source":"Crossref","is-referenced-by-count":15,"title":["Two algorithms for constructing a binary tree from its traversals"],"prefix":"10.1016","volume":"28","author":[{"given":"Gen-Huey","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.S.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.T.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0020-0190(88)90177-9_BIB1","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01934177","article-title":"Alternative methods for the reconstruction of trees from their traversals","volume":"27","author":"Burgdorff","year":"1987","journal-title":"BIT"},{"issue":"4","key":"10.1016\/0020-0190(88)90177-9_BIB2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(83)90046-7","article-title":"Listing and counting subtrees of equal size of a binary tree","volume":"17","author":"Hikita","year":"1983","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0020-0190(88)90177-9_BIB3","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/359423.359434","article-title":"A numbering system for binary trees","volume":"20","author":"Knott","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(88)90177-9_BIB4","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1973"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901779?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901779?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:21:52Z","timestamp":1555075312000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088901779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,8]]},"references-count":4,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,8]]}},"alternative-id":["0020019088901779"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90177-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,8]]}}}