No description
| 01_binary_search | ||
| 02_stack | ||
| 03_queue | ||
| 04_binary_search_tree | ||
| 05_heap | ||
| 06_graph | ||
| 07_dijkstra | ||
| 08_kahn | ||
| 09_prim | ||
| simple_array | ||
| .gitignore | ||
| Cargo.lock | ||
| Cargo.toml | ||
| README.md | ||
data-structure-exercises
This repository contains exercises to implement a selection of the data structures taught in the book "Data Structures the Fun Way". Some exercises are also about the algorithms that use the data structures.
It is forbidden to use the standard library collections to solve these exercises, that would be too easy!
That includes everything in std::collections, notably Vec and HashMap.
However, managing memory allocations is not the purpose of these exercises, so the most basic data structure is provided.
SimpleArray is basically a Vec with less functionality.
All you can do with it is create one of a specified size, set and get elements.
To read its documentation in a browser, run cargo doc --package simple_array --open.
List of exercises:
- binary search
- stack
- queue
- binary search tree
- heap
- graph algorithms:
- dijkstra
- prim
- kahn