So, I was just digging around Reflector trying to find the implementation details of HashSet (out of sheer curiosity based on the answer to another question here) and noticed the following:
internal class TreeSet<T> : ICollection<T>, IEnumerable<T>, ICollection,
IEnumerable, ISerializable, IDeserializationCallback
Without looking too deep into the details, it looks like a Self-Balancing Binary Search Tree.
My question is, is there anybody out there with the insight as to why this class is internal
? Is it simply because the other collection types use it internally and hide the complexities of a BST from the general masses...or am I way off base?