https://github.com/mstrlc/ial-homework-2

FIT VUT – IAL – binary tree and hashtable homework
https://github.com/mstrlc/ial-homework-2

algorithms binary-tree btree fit hashtable ial vut

Last synced: 7 months ago
JSON representation

FIT VUT – IAL – binary tree and hashtable homework

• Host: GitHub
• URL: https://github.com/mstrlc/ial-homework-2
• Owner: mstrlc
• Created: 2022-10-27T14:00:30.000Z (almost 3 years ago)
• Default Branch: main
• Last Pushed: 2023-02-20T19:48:54.000Z (over 2 years ago)
• Last Synced: 2024-10-24T06:30:47.762Z (12 months ago)
• Topics: algorithms, binary-tree, btree, fit, hashtable, ial, vut
• Language: C
• Homepage:
• Size: 9.77 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
### FIT VUT – IAL – 2nd homework

**10/10 points**

Implementation of a hashtable and iterative & recursive versions of a binary tree.