Skip to content

spbu-coding-2022/trees-8

Repository files navigation

Trees

teemEight's project of implementation of three trees: AVL, red-black, binary

Apache License

Authors (teemEight)

About

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.

Roadmap

  • License
  • CI
  • Realized all types of trees
  • Added tests
  • Storing with:
    • Neo4j
    • Sqlite
    • json
  • GUI

Building

To build this project run

  ./gradlew build

How to use

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.

Feedback

If you have any feedback, please reach out to us at Issues

About creators

We're a full stack developers... ((
18-20 y.o SPBU SE

🛠 Skills

2006 ELO Faciet, 1300 MMR, 1400 ELO CHESS, 21k TROPHIES BrAWL STARs, 5BC

🔗 Links (Источники вдохновления)

gradle



About

trees-8 created by GitHub Classroom

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •  

Languages