How is the time complexity of reading an element from the SortedDictionary data structure determined?

In C#, the SortedDictionary data structure is implemented based on a red-black tree — a balanced binary search tree.

The time complexity of the read operation (searching for an element by key) in SortedDictionary is O(log n), where n is the number of elements in the dictionary.

This is because the search involves traversing the tree, reducing the number of checks logarithmically, unlike, for example, Dictionary, where the search is O(1) on average, but without key ordering.