jasterv/cool-data-structures
1
0
Fork 0
mirror of https://codeberg.org/JasterV/cool-data-structures.git synced 2026-04-26 18:40:04 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
No description
23 commits 1 branch 0 tags 152 KiB
Rust 100%
Find a file
Víctor Martínez be849d383e
Update README.md
2020-12-09 00:51:24 +01:00
assets readme updated 2020-12-09 00:50:25 +01:00
src little change on hash set 2020-12-09 00:39:07 +01:00
tests Binary Tree implemented, traversals implemented, tests done 2020-12-07 02:33:31 +01:00
.gitignore first commit, project initialized 2020-12-05 20:37:52 +01:00
Cargo.toml first commit, project initialized 2020-12-05 20:37:52 +01:00
README.md Update README.md 2020-12-09 00:51:24 +01:00

README.md

Cool data structures

Doubly Linked List

A doubly linked list implemented with Rust, it use Reference counters and Reference cells together to let multiple nodes own a node and modify it

linked list

Sorted Binary Tree

A simple binary Tree which stores its elements in an ordered way. It implements the 3 most common traversals for binary trees: Inorder, postorder and preorder.

binary tree

Hash Set

A Hash Set implemented as a Hash Map (A list of buckets where each bucket owns a Linked List with values)

hash map

This diagram does not represent a HashSet but a HashMap