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).
comments powered by Disqus