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:52 +01:00
parent 99e9f5aa93
commit 494e57d46f
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
README.md
View file

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