I have a collection of strings (char *) and want to search and remove in the collection. The number of strings will be near 300 or more, so I thought I would sort the strings to speed up search and removal. But what will be the best way to do this?
I'm trying to do it with a AVL tree (Binary tree with the one subtree not being (much) deeper than the other) but it is slow in creation with a lot of data (100000 items or more ). I also read about a RedBlack Tree, but I don't yet know how to do that one.
Are there any other ways to do this in a fast way?