.NET helpers and data structures Trie Red Black Tree insert element (key/value pair) delete element by key find first and last elements find floor and ceiliing elements empty, clear, count, contains accessor Intervals intersection Skip List search add erase