Binary apple tree: A game approach to tree traversal algorithms

The computer science students mostly face with the difficulties in learning the topics of algorithms courses. Only listening the topic from the teacher or just writing makes the learning volatile. Instead of listening or writing, if there is something visual, it would be more permanent to learn because visuality increases the learning potential and the time for learning is minimized. The adversities of classical education techniques were intended to be eliminated in this study via computer games which are becoming more and more popular in this age. An educational convenience is provided for the subject of tree traversal algorithms. Tree traversal algorithms are one of the basic and confused concepts in algorithms and programming courses in computer science. A game called “binary apple tree” was established to teach and learn the subject easier.

[1]  Jamshaid G. Mohebzada,et al.  The cubes: A tangible game-based learning system , 2011, 2011 International Conference on Innovations in Information Technology.

[2]  Bing Tan,et al.  Notice of RetractionGame-based Learning for Data Structures: A case study , 2010, 2010 2nd International Conference on Computer Engineering and Technology.

[3]  Shahida Sulaiman,et al.  Game-based approach and its feasibility to support the learning of object-oriented concepts and programming , 2011, 2011 Malaysian Conference in Software Engineering.

[4]  Alessandro Amoroso,et al.  P-2-P games for computer science , 2010, 2010 IEEE International Conference on Multimedia and Expo.

[5]  Lindsay D. Grace,et al.  Shapemaker: A game-based introduction to programming , 2011, 2011 16th International Conference on Computer Games (CGAMES).