# Red-Black Tree in C#

Red-Black Trees are another self balancing binary search tree data structure. Much like the AVL Tree which is also self balancing and has the same time complexity O(log n) for best, average & worst case. Red-Black Trees are a bit more efficient in insertion and deletion in that they require less work to be done,…