Implementationen der ADTs für das Abitur Niedersachsen (KC konform)

A data structure that enables the storage and search of points in two-dimensional space. It is implemeneted as a binary tree, where the nodes are partitioned based on their coordinates. The partitioning is done based on a comparator that alternates between comparing the x- and y-coordinates of the points on each level.

Postfix converter that implements a stack interface and stack class to convert infix expressions to postfix expressions

Trabajo Practico Obligatorio sobre la materia de progracion II, escrito en lenguaje Java

1D chess demo and live coding for CS club

Data Structures and Algorithms

Simulates game in which cells on a board can move, divide, multiply, spawn and delete in order to overcome other cells and win the game

Pathfinding algorithm to find the optimal pathway given a set of constraints.

Determine the champion NHL team by tracking wins and losses.

Implement binary search tree with parent pointer and its iterator with Java.

Mafia game simulator using OOPS

A collection of basic data structures, written in Java.

Kata Builder GoF pattern.

2020 Mini Project

Implementation of Abstract Data Types (ADT) Algorithms

Data Structures Design - Practical Activity #2

My coursework for CMPT 202- Intro to Data Structures (Spring 2019).

adts

ADT, design patterns, contract programming.

Implemention of deque in Java