{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:18:27Z","timestamp":1754482707571},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[1999,7,1]],"date-time":"1999-07-01T00:00:00Z","timestamp":930787200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1999,7]]},"abstract":"<jats:p>Everybody learns about balanced binary search trees in their introductory computer \nscience classes, but even the stouthearted tremble at the thought of actually \n<jats:italic>implementing<\/jats:italic> such a beast. The details surrounding rebalancing are usually just too \nmessy. To show that this need not be the case, we present an algorithm for insertion \ninto red-black trees (Guibas and Sedgewick, 1978) that any competent programmer \nshould be able to implement in fifteen minutes or less.<\/jats:p>","DOI":"10.1017\/s0956796899003494","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:26:15Z","timestamp":1027761975000},"page":"471-477","source":"Crossref","is-referenced-by-count":45,"title":["Red-black trees in a functional setting"],"prefix":"10.1017","volume":"9","author":[{"given":"CHRIS","family":"OKASAKI","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[1999,7,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796899003494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T15:29:34Z","timestamp":1553873374000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796899003494\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1999,7]]}},"alternative-id":["S0956796899003494"],"URL":"https:\/\/doi.org\/10.1017\/s0956796899003494","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}