@InProceedings{rojassalazar_et_al:OASIcs.ICPEC.2020.22,
  author =	{Rojas-Salazar, Alberto and Ram{\'\i}rez-Alfaro, Paula and Haahr, Mads},
  title =	{{Learning Binary Search Trees Through Serious Games}},
  booktitle =	{First International Computer Programming Education Conference (ICPEC 2020)},
  pages =	{22:1--22:7},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-153-5},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{81},
  editor =	{Queir\'{o}s, Ricardo and Portela, Filipe and Pinto, M\'{a}rio and Sim\~{o}es, Alberto},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2020.22},
  URN =		{urn:nbn:de:0030-drops-123097},
  doi =		{10.4230/OASIcs.ICPEC.2020.22},
  annote =	{Keywords: Binary Search Tree, Data Structures, Serious Games}
}