Skip to content
Yannick Weigert
← Projects

ADT Implementations

March 13, 2024Yannick WeigertAlexanderSajeg
GymnasiumEverstenOldenburg/ADT-ImplementierungenImplementationen der ADTs für das Abitur Niedersachsen (KC konform)Java

This project aims to provide a collection of implementations for various Abstract Data Types (ADTs) required for the German Abitur curriculum in Niedersachsen. The project is written in Java and is intended to be used as a reference for both students and teachers. You can view the project on GitHub.

Intended for school use

The code is written to follow the requirements of the German Abitur curriculum in Niedersachsen. This means that the project is most likely not useful for anyone outside of this specific context.

#Data Types

We have implemented the following data types as part of our ADT implementations in Java:

BinTreeBinary tree implementation
DynArrayDynamic array implementation
QueueFIFO queue implementation
StackLIFO stack implementation
Setup guide

#Features

The project contains the core implementations of the Data Types mentioned above. Along with that, there are also test classes for each Data Type to ensure the correctness of the implementations. We also decided to include a BlueJ project zip file for easy usage in the classroom.

#Structure

kc/
├── InformatikHinweiseAb2021.pdf
├── InformatikHinweiseAb2025.pdf
└── InformatikHinweiseAb2027.pdf

projects/          [auto generated files]

src/
├── main/
│   └── java/
│       ├── BinTree.java
│       ├── DynArray.java
│       ├── Queue.java
│       └── Stack.java
└── tests/
    └── java/
        ├── TestBinTree.java
        ├── TestDynArray.java
        ├── TestQueue.java
        └── TestStack.java

Documentation