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
AI-generated apps that pass security review Icon
AI-generated apps that pass security review

Stop waiting on engineering. Build production-ready internal tools with AI—on your company data, in your cloud.

Retool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
Try Retool 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