A Threaded Red Black Tree in C# (cand be used both like a SortedSet and LinkedList)
Implementing TopDown Deletion and TopDown Insertion mainly from http://eternallyconfuzzled.com with few personal flavours
Time Complexity for inserting and deleting N nodes is O(NlogN) (both are 0-10% faster than SortedSet )
Time Complexity for Exist, Find, MoveNext is O(logN)
Time complexity for Traversing N nodes is O(N) ( 30-40% faster than SortedSet because of using tree threads)
Traversing in sorted order doesnt use a stack, so you can start traversing from any node
Nodes are public and can use them to move tru collection line in a LinkedList (moving takes O(1) for half of nodes and O(logN) in worst case)
Modifying the Tree doesnt invalidate the iterators

Project Activity

See All Activity >

Follow Threaded Red Black Tree in C#

Threaded Red Black Tree in C# Web Site

Other Useful Business Software
Gen AI apps are built with MongoDB Atlas Icon
Gen AI apps are built with MongoDB Atlas

Build gen AI apps with an all-in-one modern database: MongoDB Atlas

MongoDB Atlas provides built-in vector search and a flexible document model so developers can build, scale, and run gen AI apps without stitching together multiple databases. From LLM integration to semantic search, Atlas simplifies your AI architecture—and it’s free to get started.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Threaded Red Black Tree in C#!

Additional Project Details

Registered

2012-03-17
Report inappropriate content