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

readme updated

Browse source
This commit is contained in:
Víctor Martínez 2020-12-09 00:50:25 +01:00
parent deaaf21949
commit 99e9f5aa93
2 changed files with 8 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
README.md
View file

@ -13,3 +13,11 @@ It implements the 3 most common traversals for binary trees: Inorder, postorder
![binary tree](assets/binary-tree.png) ![binary tree](assets/binary-tree.png)
## 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](assets/hash_map.png)
This is diagram does not represent a HashSet but a HashMap

BIN
assets/hash_map.jpeg Normal file
View file

Binary file not shown.
Side by side

After

Width:  |  Height:  |  Size: 57 KiB