Home/ Questions/Q 431751
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-12T20:00:21+00:00

I’m looking for an implementation of a Red-Black Tree in C#, with the following

  • 0

I’m looking for an implementation of a Red-Black Tree in C#, with the following features:

  • Search, Insert and Delete in O(log n).
  • Members type should be generic.
  • Support in Comparer(T), for sorting T by different fields in it.
  • Searching in the tree should be with the specific field, so it won’t accept T, but it’ll accept the field type sorting it.
  • Searching shouldn’t be only exact value. Should support searching the lower/higher one.

Thank you.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    You mostly just described SortedDictionary<T, U>, except for the next-lowest/next-highest value binary search, which you could implement on your own without much difficulty.

    Are there specific reasons that SortedDictionary is insufficient for you?

    • 0