.NET Built-in AVL-Tree?

Question

Is there a built in AVL Tree in the .NET libraries?

I searched but didn't find any.

• If there is, then where? what namespace?
• If not, is there any good implementation for AVL Trees in C#?
• If also not! then is there an easy way to get it done? I know how it works and have built one in native C++ before, but now I have no time and am afraid of bad performance if I did it myself.

Answer 1

You can use a System.Collections.Generic.SortedSet<T>. I think it is implemented using a red-black tree which is very similar to an AVL tree.

Answer 2

A quick search found an implementation here. The code looks clean, but I haven't tried it.

If nothing else, you could do a quick performance test against SortedSet<T> (as suggested by @Josef) to see if there's any difference for your use case.