Items in a sorted list can be retrieved by performing a binary search on the list, which typically takes O(log(N)) time. A binary search tree performs the task of retrieving, removing, and inserting an object in the same amount of time. With a few modifications, a binary search tree can become an AVL, which self-balances to prevent the underlying data structure from degrading into a linked list.

More information on AVL trees can be found at https://en.wikipedia.org/wiki/AVL_tree.

Note: A hash table can perform retrieving, removing, and insertion operations in O(1) time. Your code, however, looks like it needs to find out whether an event matches one of the filters in your list. In that situation, the retrieval operation might degrade into a linear search, which takes O(N) time.