Authors: Samir Yau Nuhu, Jamilu Awwalu, Zaharaddeen Salele Iro, Zaharaddeen Sufyanu
Abstract: Tree traversal algorithms form a major part of undergraduate computer science education because they teach important concepts about how data is organized and processed in trees. However, students find these algorithms difficult to understand since they are abstract and involve following specific rules to visit each node in a particular sequence. Existing visualization tools fail to help students fully because they do not clearly separate or explain the differences between the three main Depth-First Search variants, and they do not show the step-by-step order of visited nodes in a simple and structured format. To solve these problems, this thesis presents a new interactive learning tool that runs directly in a web browser and is built using HTML, CSS, JavaScript and SVG. The tool allows students to create their own binary trees by adding nodes, gives them full control to move through each step of any traversal method, and includes a table-generation feature that automatically builds and displays a clear list showing exactly which nodes are visited and in what order. We carried out an analysis of the system’s algorithms and showed that it remains efficient and scalable even when working with larger tree. In addition, we tested the tool in a real classroom setting with 100 undergraduate computer science students. Before using the tool, their average score on a test about tree traversals was only 40%. After use of the tool their average score increased to 68%. These results clearly demonstrate that the new system overcomes the main weaknesses of earlier visualization tools and helps students gain a better understanding of tree traversal algorithms.
DOI: http://doi.org/10.5281/zenodo.21334804
