Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am looking for something like a tree. We are constantly inserting into an already sorted collection. We would like access to the minimum and maximum value. We don’t need any keys, just the value. I couldn’t find any tree structures from .Net and I couldn’t see any thing else that looked like what I am looking for.
In .NET 4.0 there’s SortedSet – it looks like that would do what you want, and it has
MinandMaxproperties..NET 3.5 has
HashSet, but that only deals with equality rather than ordering.