thenonameguy's blog

Project #1: A data structure a day

Day #4-#5: Binary Search Tree

Sorry guys and gals, my ISP decided to screw me over yesterday evening, so I couldn't upload the new post. To make matter worse, I couldn't really wrap my head around Hashmaps so I rather implemented binary search trees (BSTs).
A BST is a sorted binary tree type, making it great for retrieving,inserting and removing large amount of data in O(log(n)) time.The data needed for it is O(1).
I learned many new things about C++ and programming in general in the past 4 days, but I need to use these newfound concepts in my spare-time/real applications, so there will be a short pause in my A data structure a day project.
comments powered by Disqus