Is there a built-in Binary Search Tree in .NET 4.0?

c# .net binary-tree
Benny Skogberg picture Benny Skogberg · Jul 16, 2010 · Viewed 52k times · Source

Is there a built-in binary search tree in .NET 4.0, or do I need to build this abstract data type from scratch?

Edit

This is about the binary search tree specifically, and not abstract data type "trees" in general.

Answer

herzmeister picture herzmeister · Jul 16, 2010

I think the SortedSet<T> class in System.Collections.Generic is what you're looking for.

From this CodeProject article:

It is implemented using a self-balancing red-black tree that gives a performance complexity of O(log n) for insert, delete, and lookup. It is used to keep the elements in sorted order, to get the subset of elements in a particular range, or to get the Min or Max element of the set.

Source code https://github.com/dotnet/corefx/blob/master/src/System.Collections/src/System/Collections/Generic/SortedSet.cs

Related questions

Objects that represent trees

Are there any objects in C# (or in .net) that represents a binary tree (or for curiosity) and n-ary tree? I am not talking about presentation tree controls, but as model objects. If not, are there any good external implementations?

Read More
Is SortedDictionary a red-black tree?

I saw several quotes about this on the Internet but no official documentation? Can anyone tell me where I can get information about this?

Read More
How to make an HTTP POST web request

Canonical How can I make an HTTP request and send some data using the POST method? I can do a GET request, but I have no idea of how to make a POST request.

Read More