teemEight's project of implementation of three trees: AVL, red-black, binary
It is a library that provides kotlin implementations of 3 binary search trees data
structures: BS tree, AVL tree, Red-black tree.
It also provides storing BSTs in either plain .json
files, SQLite
or neo4j
databases.
- License
- CI
- Realized all types of trees
- Added tests
- Storing with:
- Neo4j
- Sqlite
- json
- GUI
To build this project run
./gradlew build
If you need access to trees, see official documentation
To run our tree viewer
./gradlew run
The viewer is currently only able to open trees stored in a json file. Create an empty .json file and open it in the application, enter any name for the tree and it will be created. You can drag and drop tree nodes, add and remove values, save the state of the tree for later loading. If there are available trees in the .json file, they will be in the dropdown list.
If you have any feedback, please reach out to us at Issues
We're a full stack developers... ((
18-20 y.o SPBU SE