Learning Binary Search Trees through Serious Games based on Analogies

Abstract

Data structures and algorithms are core topics in Computer Science, and they are essential for the development of efficient software. However, data structures and algorithmic concepts are abstract and difficult to relate to previous knowledge. From a constructivist point of view, it is important that new experiences and information link to previous knowledge in order to create new knowledge. This paper presents work-in-progress on the development and evaluation of a serious game for teaching Binary Search Trees (BST) called DS-Hacker (Data Structure Hacker). DS-Hacker aims to introduce BST concepts to college students by means of relating well-known game elements with BST concepts.