{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T04:25:28Z","timestamp":1773030328455,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,2,24]],"date-time":"2015-02-24T00:00:00Z","timestamp":1424736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,2,24]]},"DOI":"10.1145\/2676723.2677232","type":"proceedings-article","created":{"date-parts":[[2015,2,24]],"date-time":"2015-02-24T14:09:31Z","timestamp":1424786971000},"page":"482-487","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Bug Infestation!"],"prefix":"10.1145","author":[{"given":"Laurie","family":"Murphy","sequence":"first","affiliation":[{"name":"Pacific Lutheran University, Tacoma, WA, USA"}]},{"given":"Sue","family":"Fitzgerald","sequence":"additional","affiliation":[{"name":"Metropolitan State University, St. Paul, MN, USA"}]},{"given":"Scott","family":"Grissom","sequence":"additional","affiliation":[{"name":"Grand Valley State University, Allendale, MI, USA"}]},{"given":"Ren\u00e9e","family":"McCauley","sequence":"additional","affiliation":[{"name":"College of Charleston, Charleston, SC, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0164-1212(95)00043-7"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(00)00023-6"},{"key":"e_1_3_2_1_3_1","first-page":"96","article-title":"Teaching linked lists and recursion without conditionals or null","volume":"18","author":"Bloch S.","year":"2003","unstructured":"Bloch , S. 2003 . Teaching linked lists and recursion without conditionals or null . J. Comput. Sci. Coll. 18 , 5, 96 -- 108 . Bloch, S. 2003. Teaching linked lists and recursion without conditionals or null. J. Comput. Sci. Coll. 18, 5, 96--108.","journal-title":"J. Comput. Sci. Coll."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1047124.1047430"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2538862.2538911"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2157136.2157148"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1352322.1352226"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/792548.612004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/637610.544441"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2538862.2538902"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272848.1272899"},{"key":"e_1_3_2_1_12_1","volume-title":"July 8-12","author":"Lee C.","year":"2014","unstructured":"Lee , C. , Roberts , E. , Cain , J. , Sahami , M. , Zelenski , J. and Stuart , R . (personal communication , July 8-12 , 2014 ). Lee, C., Roberts, E., Cain, J., Sahami, M., Zelenski, J. and Stuart, R. (personal communication, July 8-12, 2014)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1709424.1709460"},{"key":"e_1_3_2_1_14_1","volume-title":"Programming Interviews Exposed: Secrets to Landing Your Next Job","author":"Mongan J.","year":"2012","unstructured":"Mongan , J. , Kindler , N. , Gigure , E. Programming Interviews Exposed: Secrets to Landing Your Next Job , Third Edition. John Wiley & Sons, Inc. , Indianapolis, Indiana , 2012 . Mongan, J., Kindler, N., Gigure, E. Programming Interviews Exposed: Secrets to Landing Your Next Job, Third Edition. John Wiley & Sons, Inc., Indianapolis, Indiana, 2012."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2445196.2445250"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.15388\/infedu.2014.06"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140123.1140162"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00891962"},{"key":"e_1_3_2_1_19_1","first-page":"97","article-title":"Recursive objects - an object oriented presentation of recursion","volume":"38","author":"Sher D. B.","year":"2004","unstructured":"Sher , D. B. 2004 . Recursive objects - an object oriented presentation of recursion . Mathematics and Computer Education 38 , 1, 97 -- 109 . Sher, D. B. 2004. Recursive objects - an object oriented presentation of recursion. Mathematics and Computer Education 38, 1, 97--109.","journal-title":"Mathematics and Computer Education"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1207\/s15327051hci0102_4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2190\/ET.37.3.i"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/08993400500307677"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-7373(89)80018-5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272848.1272896"}],"event":{"name":"SIGCSE '15: The 46th ACM Technical Symposium on Computer Science Education","location":"Kansas City Missouri USA","acronym":"SIGCSE '15","sponsor":["SIGCSE ACM Special Interest Group on Computer Science Education"]},"container-title":["Proceedings of the 46th ACM Technical Symposium on Computer Science Education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676723.2677232","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2676723.2677232","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:19Z","timestamp":1750227139000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2676723.2677232"}},"subtitle":["A Goal-Plan Analysis of CS2 Students' Recursive Binary Tree Solutions"],"short-title":[],"issued":{"date-parts":[[2015,2,24]]},"references-count":24,"alternative-id":["10.1145\/2676723.2677232","10.1145\/2676723"],"URL":"https:\/\/doi.org\/10.1145\/2676723.2677232","relation":{},"subject":[],"published":{"date-parts":[[2015,2,24]]},"assertion":[{"value":"2015-02-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}