Binary tree and hashtable


  • Michal Ondrejka

  • GitHub

  • november, 2022

In this project, I implemented two essential data structures: binary trees and hash tables. I started by designing and implementing a binary tree, including algorithms for insertion, deletion, and search operations. I also incorporated traversal algorithms like in-order, pre-order, and post-order traversals.
Next, I created a hash table that supports efficient key-value pair storage and retrieval. This involved designing hashing functions, handling collisions, and implementing essential operations.
Overall, this project exemplifies my proficiency in implementing and utilizing binary trees and hash tables. It showcases my strong foundation in data structures and algorithmic problem-solving, valuable skills in software development.