Pure Parity Seeking 2-3 Red Black Binary Tree

Sat, 15 Jun 2024 00:00:00 +0000

Implemented a 2-3Red-Black Tree based on the “Parity-Seeking” deletion algorithm from a recent academic paper [Link]. The project focused on reusability and object-oriented design in C++, structured as a library-like module.

This implementation provides a pedagogically sound yet efficient approach to deletion in 2-3 red-black trees, making it suitable for educational or competitive programming use.

Sepehr – Automatic Scoring System

Fri, 01 Sep 2023 00:00:00 +0000

Sepehr is an automatic scoring system developed for programming exercises, with a particular focus on data structures and algorithm design problems. It was initially created during my internship at Part Research Institute and later used in both university-level and national-level Dataleague programming contests.

The system automates the evaluation of code submissions, streamlining the process of grading and feedback for competitive programming and coursework. It has been actively used in:

Data Structures and Algorithm Design courses at Ferdowsi University of Mashhad,
The University-level Dataleague Contest (2023–2024),
And the National Dataleague Contest (2024–2025).

Sepehr is designed with modularity and scalability in mind, enabling flexible integration into different contest platforms and academic environments.

Algorithm Design | mmrahneshin

Pure Parity Seeking 2-3 Red Black Binary Tree

Sepehr – Automatic Scoring System