
@dronkoff @Oblivious9021 @Priyannkaaaa a hashmap is O(1) time for lookup while a b tree is O(logn). if you want to see if a username is taken, a hashmap will always be faster. if you wanted to sort usernames for example, all usernames starting with d or an underscore, then a tree is better
English































