1.1.0

New modules:

• Add min and max heap data structure.

New features:

• Queue : handle size incrementation when inserting in a full queue.
• Stack : handle size incrementation when inserting in a full stack.
• Stack Push and queue Enqueue methods no longer return an error.

Minor changes:

• Automate issues-branches-pr with issue-branch bot.
• Remove linter.
• Update tests.
• Add how to use documentation.
• Utils package added for futur implementations.

Related issues:

• 15
• 16
• 18
• 19
• 20
• 21
• 22

1.0.1

Minor changes

• Update documentation
• New github action to lint the code
• Test code before building in go workflow

1.0.0

Core features

Creation of the following data structures:

• stack
• queue
• linked list
• binary search tree
• graph (more features to come)

Coming soon

• implementation of heaps
• graph shortest path algorithms (A*, Dijkstra...)

Feel free to check the docs