Educational games have emerged as powerful tools for enhancing learning experiences across various subjects and age groups. This project represents an innovative approach to combining educational content with interactive and engaging gameplay to teach important Computer Science concepts such as data structures and Algorithms. Current implementations of algorithms representation have good algorithmic coverage and offer good visualizations of algorithms and data structures, but they lack the level of interactivity required for active participation of the student. This project aims to foster active learning by allowing students to solve the given example through direct manipulation of nodes and/or edges of trees and graphs. This game presents a platform for college students to learn and actively practice the Heap data structure, the Heapsort algorithm, and minimum weight spanning tree Algorithms such as Kruskal and Prim. Built using JavaScript, HTML, CSS, and Three.js, the game incorporates a 3D interactive environment to pilot these concepts. Multiple levels of difficulty, immediate feedback, and a carefully designed hint system were designed to support stepwise learning and enhance interactive experience. Multiple lives and a scoring system keep the students engaged and give them several chances to correct their mistakes. Anonymous Data collection of number of mistakes, time spent and change of score per level, runs in the background, to allow professors to track improvement, and analyze students’ comprehension and performance without storing identifying information on the students. Gamification of additional data structures and algorithms is currently being developed.