Teaching Binary Tree Algorithms through Visual Programming

In this paper, we show how visual programming can be used to teach binary tree algorithms. In our approach, the student implements a binary tree algorithm by manipulating tree fragments (not necessarily just single nodes) in a visual way. This work contributes to visual programming research by combining elements of animation, programming, and proof to produce an educational visual programming tool. In addition, we describe our experiences with Opsis, a system we built to demonstrate the ideas in this paper. (Opsis is a Java applet and can be accessed at http://www.cs.washington.edu/homes/amir/Opsis.html.) Finally, we make the claim that visual programming is an ideal way to teach data structure algorithms.

• Type: Conference
• Year: 1996
• Where: VL
• Authors: Amir Michail
• Keywords: Binary Tree Algorithm, Visual Languages, Visual Programming, Visual Programming Research, VL 1996